Abstract
The paper presents proposals of a new architecture and respective task scheduling algorithms for a multi-processor system based on dynamically organised shared memory clusters. The clusters are organised around memory modules placed in a common address space. Each memory module can be accessed through a local cluster bus and a common inter-cluster bus. Execution of tasks in a processor is done according to a specific macro dataflow model. It allows task execution only if all data needed by a task have been loaded into processor data cache. The data cache pre-fetching and single assignment data move principle enable elimination of cache thrashing and cache coherence problem. An extended macro dataflow graph representation is introduced that enables modelling of data bus arbiters, memory modules and data caches in the system. A task scheduling algorithm is proposed that defines mapping of program tasks into dynamic processor clusters on the basis of a program graph analysis. The algorithm is based on a modified Dominant Sequence Clustering approach and defines such dynamic structuring of clusters that minimises program execution time.
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
J. Protic, M. Tomasevic, V. Milutinovic: A Survey of Shared Memory Systems, Proc. of the 28th Annual Hawaii International Conference of System Sciences, Maui, Hawai, Jan. 1995, pp. 74–84.
D. Sima, T. Fountain, P. Kacsuk: Advanced Computer Architectures; A Design Space Approach, Addison-Wesley, 1997.
Y. Kanaka, M. Matsuda, M. Ando, K. Kazuto, M. Sato: “COMPaS”: A Pentium Pro PC-based SMP Cluster and its Experience, IPPS Workshop on Personal Computer Networks of Workstations, LNCS 1388, pp. 486–497, 1998.
“Scalable Clusters of Commodity Computers”, http://www.csag.cs.uiuc.edu/projects/clusters.html
Multimax Technical Summary, Encore Computer Corporation, March 1987.
D. Lenoski et al: The Stanford Dash multi-processor, IEEE Computer, Vol. 25, N. 3, 1992, pp. 63–79.
Convex Exemplar Architecture, Convex Press, 1994, p. 239.
T. Lang et al.: Bandwidth of Crossbar and Multiple-Bus Connections for Multiprocessors, IEEE Trans. on EC, Vol. C-11, N. 12, 1982, p. 1237–1234.
C.R. Das, L.N. Bhuyan: Bandwidth Availability of Multiple-Bus Multiprocessors, IEEE Trans. on Computers, Vol. C-34, N. 10, Oct. 1985, pp. 918–926.
Q. Yang, L.N. Bhuyan, Performance of Multiple-Bus Interconnections for Multiprocessors, Journal of Parallel and Distributed Computing 8, (March 1990), pp. 267–273.
D.M. Tullsen, S.J. Eggers: Effective Cache Pre-Fetching on Bus Based Multiprocessors, ACM Trans. on Comp. Systems, Vol. 13, N. 1, Feb. 1995, pp. 57–88
D.A, Koufaty et al: Data Forwarding in Scaleable Shared Memory MultiProcessors, IEEE Trans. on Parallel and Distr. Technology, Vol. 7, N. 12, 1996, pp. 1250–1264.
A. Milenkovic, V. Milutinovic: Cache Injection: A Novel Technique for Tolerating Memory Latency in Bus-Based SMPs, Proc. of the Euro-Par 2000, LNCS 1900, 2000, pp. 558–566.
T. Yang and A. Gerasoulis: PYRROS: Static Task Scheduling and Code Generation for Message Passing Multiprocessors, Proc. of 6th ACM Int’l Conf. on Supercomputing (ICS92), 1992, pp. 428–437.
Y.K. Kwok, I. Ahmad: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, Vol. 7, N. 1, January 1996, pp. 46–55.
A. Gerasoulis, T. Yang: A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors, Journal of Parallel and Distributed Computing, Vol. 16, 1992, pp. 276–291.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tudruj, M., Masko, L. (2002). An Architecture and Task Scheduling Algorithm for Systems Based on Dynamically Reconfigurable Shared Memory Clusters. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-47840-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43672-0
Online ISBN: 978-3-540-47840-9
eBook Packages: Springer Book Archive