DEMOS - a system for discrete event modelling on Simula.

Publisher: Macmillan, ISBN: 978-0-333-23881-3
Source: DBLP
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Because of the difficulty of simulating large complex systems with traditional tools, new approaches have and are being developed. One group of interrelated approaches attempts to simultaneously make simulation modeling and analysis easier while at the same time providing enough power to handle more complex problems. This group includes the following important (overlapping) approaches: integrated simulation support environments, object-oriented simulation, and knowledge-based simulation. Query driven simulation fits somewhere in the middle of these three approaches. Its fundamental tenant is that simulationists or even naive users should see a system based upon query driven simulation as a sophisticated information system. A system/environment based upon query driven simulation will be able to store information about or to generate information about the behavior of systems that users wish to study. Active KDL (Knowledge/Data Language), which is a functional object-oriented database sys...
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: It is pointed out that, when looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the field of theoretical computer science. It is shown how this kind of investigation can be done on a simple but versatile environment for programming and measuring of PRAM (parallel random access machine) algorithms. The practical value of Cole's parallel merge sort algorithm has been investigated by comparing it with Batcher's bitonic sorting. The O (log n ) time consumption of Code's algorithm implies that it must be faster than bitonic sorting which is o (log<sup>2</sup> n ) time, if n is large enough. However, it has been found that bitonic sorting is faster as long as n is less than 1.2×10<sup>21 </sup>. Consequently, it is concluded that Cole's logarithmic time algorithm is not fast in practice
    Supercomputing '90. Proceedings of; 12/1990
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An object-oriented framework, developed in C++, that consists of a set of interfaces and classes, is introduced. This framework embodies an abstract design for raster-based hydrological models. It supports the adaptive development of hydrological models with varying level of detail in spatial discretization and process description, i.e. variations of lumped, semi-distributed or distributed and conceptual or process based models. A lumped model and an adapted semi-distributed model, following the HBV concept, were implemented based on the framework and applied to a mesoscale catchment. Model uncertainties according to parameter identifiability and the simulation results were compared.
    Proceedings of the 7th International Conference on Hydroinformatics, Nice; 09/2006

Full-text (2 Sources)

Available from
Aug 1, 2014