[13] | Laszlo Böszörmenyi, Informatik in der Schule, In Erziehungskunst - Monatsschrift zur Pädagogik Rudolf Steiners, Erziehungskunst, Stuttgart, Germany, pp. 113-121, 1997.
[bib][url] [pdf] |
[12] | Laszlo Böszörmenyi, Karl-Heinz Eder, Carsten Weich, A Very Fast Parallel Object Store for Very Fast Applications, In Simulations Practice and Theory, Elsevier, vol. Volume 5, Numbers 7-8, Oxford, United Kingdom, pp. 605-622, 1997.
[bib] [pdf] [abstract]
Abstract: An architecture for a memory-resident, Parallel and Persistent ObjectSTore (PPOST) is suggested. Different object-oriented databases might be built on top of PPOST. The term memory-resident (or main memory based) means that the primary storage device is main memory. Persistence is guaranteed automatically by managing secondary and stable storage devices (such as main memory with uninterrupted power supply, discs and tapes). The architecture is able to take advantage of available main memory in a parallel or distributed environment. Thus, transactions can be actually performed with memory-speed, without being limited by the size of the memory of a given computer. Such an architecture is especially advantageous for applications requiring very fast answers, such as CAD or high-performance simulation.
|
[11] | Laszlo Böszörmenyi, Karl-Heinz Eder, M3Set - A Language for Handling of Distributed and Persistent Sets of Objects, In Parallel Computing, Elsevier, vol. 22, no. 13, Oxford, United Kingdom, pp. 1897-1912, 1997.
[bib][url] [abstract]
Abstract: We claim that distributed object-oriented systems must provide a higher level of abstraction to their users, than usually provided. Especially, it is necessary to provide application-oriented, intelligent aggregates of objects with transparent distribution of their elements. Beside that, it seems to be not only reasonable, but also relatively easy to connect persistence with distribution. A system, offering distributed and persistent polymorphic sets of objects, on the level of a clean, type safe programming language is introduced. The user of such a system gets distribution and persistence in the same "natural" way, as users of traditional systems get volatile arrays of numbers or classes of objects.
|
[10] | Karl-Heinz Eder, Laszlo Böszörmenyi, Optimized Parallel Sets for Data Intensive Applications, In DEXA '96 Proceedings of the 7th International Workshop on Database and Expert Systems Applications (Roland Wagner, Helmut Thoma, eds.), Springer Verlag, Heidelberg, pp. 185, 1996.
[bib] [doi] [abstract]
Abstract: An extension of a general-purpose programming language (gpPL) is presented. It enables parallelism, persistence and query optimization based on sets. The authors demonstrate that in gpPLs the primitive "set" can be generalised for the needs of database and expert system applications. Side-effect free declarative queries, based on set expressions, can be optimized and executed in parallel. Individual optimization and parallelization are integral parts of the language system and compiler. Very different combinations of persistent or volatile, and parallel or sequential, and optimized or non-optimized implementations are possible. This is eased by the fact that a great part of the implementation is located outside the compiler with the help of predefined interfaces. Different algebras, optimizers or algorithms can be considered. The same program can be executed without modification in various systems or platforms.
|
[9] | Laszlo Böszörmenyi, Andreas Stopper, Acceleration of Distributed, Object-Oriented Simulations Using a Graph-Optimizing Approach, In Directory of Simulation Software, 1996 (Agostino Bruzzone, Eugene Kerckhoffs, eds.), Society for Computer Simulation International, Genoa, Italy, pp. 56, 1996.
[bib] [pdf] [abstract]
Abstract: An approach to accelerate distributed, object-oriented simulations is presented in this paper. It is based on the assumption that a higher acceleration can be achieved in an easier way, if the problem is alread tackled early at the modeling stage [STOP 95]. The user adds hints about the communication behavior and frequencies of object classes to the simulation model. Based on this information, an object graph is generated and distributed to a selected number of partitions. The distribution phase is fully automatic. As a result a distribution of the problem nearby the communication optimum is generated. In the next phase the distributed simulation program (code) is generated. In a final step the user only has to code the methods of the object classes and run the simulation. The major advantage of this approach is that the user is freed from the difficult task of finding a good distribution for the problem to be simulated, which is an important factor for the overall performance of the simulation. Another advantage is the possibility to vary model information (hints) about the communication, and get a new (quasi optimal) version of the simulation automatically generated.
|
[8] | Laszlo Böszörmenyi, Woher kommt die Information?, Chapter in 25 Jahre Universität Klagenfurt (Universitaet Klagenfurt, ed.), Carinthia GmbH, Klagenfurt, Austria, pp. 278, 1996.
[bib] |
[7] | Laszlo Böszörmenyi, Andreas Stopper, A Distributed, Object Oriented Simulation System based on Hints, In Eurosim´95 (Felix Breitenecker, Irmgard Husinsky, eds.), Elsevier, Vienna, pp. 1356, 1995.
[bib] [abstract]
Abstract: A hint-based, distributed, discrete, object-oriented simulation system is described. In course of the design phase of the simulation model, explicit hints can be provided concerning dependencies and information flow inside the model. The process of parallelization consists of two major steps. In the first step, the abstract model, enriched with user-supplied hints is mapped onto an arbitrary number of active units. In the second step, the active units are mapped onto a given number of physical nodes, characterized by their processing capacity and by the communication latency between them. The distribution scheme may be dynamic, i.e. simulation objects can change their location in course of the simulation, in order to get better performance. Klaus.Leopold 05.04.2001.
|
[6] | Laszlo Böszörmenyi, Karl-Heinz Eder, Adding Parallel and Persistent Sets to Modula-3, In Proceedings of the Joint Modular Languages Conference (Peter Schulthess, ed.), Universitätsverlag Ulm, Ulm, pp. 201-216, 1994.
[bib] [pdf] [abstract]
Abstract: Parallel and persistent object sets are suggested to be incorporated into general-purpose programming languages. Two alternative implementations are presented. The actual form of the proposal is an extension of Modula-3.
|
[5] | Laszlo Böszörmenyi, Phantasie und TV-Gewalt, In Erziehungskunst - Monatsschrift zur Pädagogik Rudolf Steiners, Erziehungskunst, vol. 58. Jahrgang, no. 3, Stuttgart, Germany, pp. 210-212, 1994.
[bib][url] |
[4] | Laszlo Böszörmenyi, Informatik in der Grundschule, In Didaktische Zeitschrift des IST-Zentrums Linz, Interdisziplinäre Zentrum für Soziale Kompetenz, Linz, Austria, pp. 15-17, 1993.
[bib] |
[3] | Laszlo Böszörmenyi, A Comparison of Modula-3 and Oberon-2: extended version, In Structured Programming, Springer, vol. Volume 14, no. 1, Berlin, Heidelberg, New York, pp. 15-22, 1993.
[bib] |
[2] | Laszlo Böszörmenyi, Informatik und Wissenschaftsgeschichte, In Informatik in der Schule - Informatik für die Schule, Böhlau, vol. 10, Vienna, Austria, pp. not available, 1992.
[bib] [abstract]
Abstract: Informatik in der Schule - Informatik für die Schule.
|
[1] | Laszlo Böszörmenyi, A Comparison of Modula-3 and Oberon-2, In Proceedings of the 7th Joint Conference of the Austrian Computer Society (OCG) and the John von Neumann Society for Computing Sciences (NJSZT), Klagenfurt, 1992 (Roland Mittermeir, ed.), Springer, Berlin, Heidelberg, New York, pp. 126-137, 1992.
[bib] [abstract]
Abstract: Proceedings of the 7th Joint Conference of the Austrian Computer Society (OCG) and the John von Neumann Society for Computing Sciences (NJSZT), Klagenfurt, 1992.
|