๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A distributed event processing method for general purpose computation

โœ Scribed by Nasser Kalantery

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
864 KB
Volume
44
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.

โœฆ Synopsis

Previous proposals for the application of discrete event oriented methods to automatic parallelization have been based on the optimistic execution strategy. In this paper we present a new method which avoids optimistic execution. This is motivated by the observation that the control structure of a conventional program constitutes a temporal coordinate system which is exogenous to the program execution. The method employs a logical time mechanism and provides adaptive synchronisation for the distributed execution. Hence Data dependent and/or conditional parallelism is released without the risk of coherency violation. The paper begins with a brief introduction to Parallel Discrete Event Simulation (PDES) paradigm. Efficient coarse grain mapping of conventional programs onto this paradigm is then discussed.

๐Ÿ“œ SIMILAR VOLUMES

A fast general-purpose clustering algori
A fast general-purpose clustering algorithm based on FPGAs for high-throughput data processing
โœ A. Annovi; M. Beretta ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

We present a fast general-purpose algorithm for high-throughput clustering of data ''with a twodimensional organization''. The algorithm is designed to be implemented with FPGAs or custom electronics. The key feature is a processing time that scales linearly with the amount of data to be processed.