Abstract
This chapter presents a comprehensive description of an architecture designed with two principal goals in mind. First, the architecture provides a large synchronization space that efficiently implements a variety of synchronizations that are commonly used. Second, it provides fast switching between concurrent computations. The description includes the basic model of a multi-threaded architecture, examples of programming paradigms, synchronization primitives, and hardware implementing critical components of the architecture. Also included are extensions to the architecture to support a priority-driven paradigm for building predictable real-time systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arvind, D. E. Culler, and K. Ekanadham. The price of asynchronous parallelism: An analysis of dataflow architectures. Proceedings of CONPAR 88, British Computer Society, 1988.
Arvind and R. A. Iannucci. Two fundamental issues in multi-processing. Proceedings of DFVLR Conference on parallel processing in science and engineering, Bonn-bad, W. Germany, 1987.
Arvind and K.Ekanadham. Future scientific programming on parallel machines. Journal of Parallel and Distributed Computing, 5, 1988.
Arvind and R. S. Nikhil. Executing a program on the MIT tagged-token dataflow architecture. IEEE Transactions on Computers, T-C-39 (3), 1990.
Arvind, R. S. Nikhil, and K. K. Pingali. I-structures: Data structures for parallel computing. Proceedings of Workshop on Graph Reduction, Santa Fe, NM, (also in Springer-verlag LNCS 279), 1986.
R. E. Buehrer and K. Ekanadham. Incorporating dataflow ideas into von neumann processors for parallel execution. IEEE Transactions on Computers, T-C-36 (12), 1987.
R. A. Iannucci. A dataflow/von neumann hybrid architecture. (Ph.D. Thesis) LCS TR-418, MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA, 1988.
J. P. Lehoczky and L. Sha. Performance of real-time bus scheduling algorithms. ACM Performance Evaluation Review, Special Issue Vol. 14, No. 1, May, 1986.
C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard real time environment. JACM, 20 (1):46–61, 1973.
R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessors. The Tenth International Conference on Distributed Computing Systems, 1990.
R. Rajkumar. Synchronization in real-time systems: a priority inheritance approach. Kluwer Academic Publishers, ISBN 0–7923–9211–6, 1991.
L. Sha, R. Rajkumar, and J. P. Lehoczky. Task scheduling in distributed real-time systems. Proceedings of IEEE Industrial Electronics Conference, 1987.
L. Sha, R. Rajkumar, J. P. Lehoczky, and K. Ramamritham. Mode changes in a prioritized preemptive scheduling environment. The Real-Time Systems Journal, December 1989.
L. Sha, R. Rajkumar, and J. P. Lehoczky. Real-Time scheduling support in IEEE Futurebus+. IEEE Real-Time Systems Symposium, December 1990.
K. Toda et al. Coda: A parallel processing architecture for real-time sensor applications. Technical Report, Electro-Technical Laboratories, Japan, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ekanadham, K., Gregor, S., Hiraki, K., Iannucci, R.A., Rajkumar, R. (1994). An Architecture for Generalized Synchronization and Fast Switching. In: Iannucci, R.A., Gao, G.R., Halstead, R.H., Smith, B. (eds) Multithreaded Computer Architecture: A Summary of the State of the ART. The Springer International Series in Engineering and Computer Science, vol 281. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2698-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2698-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6161-9
Online ISBN: 978-1-4615-2698-8
eBook Packages: Springer Book Archive