Task Scheduling for Dynamically Configurable Multiple SMP Clusters Based on Extended DSC Approach

  • Marek Tudruj
  • Łukasz Masko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


The paper presents a proposal of task scheduling algorithm for a multi-processor system based on dynamically organised shared memory processor clusters. A cluster contains processors with data caches connected to a data memory module by an internal cluster bus. Each data memory module is also accessible for a global inter-cluster bus that is available for all processors. Execution of tasks in a processor is done according to a specific macro dataflow model. It allows task execution only if all the required data have been loaded into processor data cache. The task scheduling algorithm defines mapping of program tasks into dynamic processor clusters on the basis of a program graph analysis. A program is represented by a macro dataflow graph extended by representation of actions of bus arbiters, data caches and memory modules. The resulting dynamic structuring of processor clusters minimizes the parallel program execution time. The algorithm is based on a modified Dominant Sequence Clustering approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    D. Sima, T. Fountain, P. Kacsuk: Advanced Computer Architectures; A Design Space Approach, Addison-Wesley, 1997.Google Scholar
  3. 3.
    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 Based Networks of Workstations, LNCS 1388, pp. 486–497. 1998.Google Scholar
  4. 4.
    Scalable Clusters of Commodity Computers,
  5. 5.
    Multimax Technical Summary, Encore Computer Corporation, March 1987.Google Scholar
  6. 6.
    D. Lenoski et al.: The Stanford Dash multi-processor, IEEE Computer, Vol. 25, N. 3, 1992, pp. 63–79.CrossRefGoogle Scholar
  7. 7.
    Convex Exemplar Architecture, Convex Press, 1994, p. 239.Google Scholar
  8. 8.
    D.M. Tullsen, S.J. Eggers: Effective Cache Pre—fetching on Bus Based Multiprocessors, ACM Trans. on Computer Systems, Vol. 13, N. 1 Feb. 1995, pp. 57–88.CrossRefGoogle Scholar
  9. 9.
    D.A. Koufaty et al.: Data Forwarding in Scaleable Shared Memory Multi-Processors, IEEE Trans. on Parallel and Distr. Technology, Vol. 7, N. 12, 1996, pp. 1250–1264.CrossRefGoogle Scholar
  10. 10.
    A. Milenkovic, V. Milutinovic: Cache Injection: A Novel Technique for Tolerating Memory Latency in Bus-Based SMPs, Proceedings of the Euro—Par 2000, LNCS 1900, 2000, pp. 558–566.CrossRefGoogle Scholar
  11. 11.
    T. Yang, 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.Google Scholar
  12. 12.
    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.CrossRefGoogle Scholar
  13. 13.
    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.MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    M. Tudruj, L. Masko: A Parallel System Architecture Based on Dynamically Configurable Shared Memory Clusters, Proceedings of the PPAM 2001 Conference, Naleczów, Poland, 4–6 Sept. 2001, LNCS, Springer Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Marek Tudruj
    • 1
  • Łukasz Masko
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarsawPoland

Personalised recommendations