Scheduling Parallel Programs Based on Architecture–Supported Regions

  • Marek Tudruj
  • Łukasz Maśko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7204)


Modern multicore processor technology can fairly easily deliver special accelerator processors dedicated to fast optimised execution of critical computational functions. Multi CMP (Chip Multi-Processor) systems can be composed as a set of dedicated and general purpose computational modules interconnected by a global data exchange network. The paper proposes special program scheduling algorithms for such systems. Dedicated CMP modules assumed in the paper are based on a new data communication model called communication on the fly. It enables strong reduction of inter–process and inter–core communication overheads for intensively shared data.


Schedule Algorithm Program Graph Support Region List Schedule Architectural Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nurmi, J., Tenhunen, H., Isoaho, J., Jantsch, A. (eds.): Interconnect–Centric Design for Advanced SOC and NOC. Springer (2004)Google Scholar
  2. 2.
    Kundu, S., Peh, L.S.: On–Chip Interconnects for Multicores. IEEE Micro, 3–5 (September-October 2007)Google Scholar
  3. 3.
    Owens, J.D., et al.: Research Challenges for On–Chip Interconnection Networks. IEEE Micro, 96–108 (September-October 2007)Google Scholar
  4. 4.
    Milenkovic, A., Milutinovic, V.: Cache Injection: A Novel Technique for Tolerating Memory Latency in Bus-Based SMPs. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 558–566. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Tudruj, M., Maśko, Ł.: Dynamic SMP Clusters with Communication on the Fly in NoC Technology for Very Fine Grain Computations. In: 3rd Int. Symp. on Parallel and Distributed Computing, ISPDC 2004, Cork, pp. 97–104 (July 2004)Google Scholar
  6. 6.
    Tudruj, M., Maśko, Ł.: Towards Massively Parallel Computations Based on Dynamic SMP Clusters wih Communication on the Fly. In: Proceedings of the 4th International Symposium on Parallel and Distributed Computing, ISPDC 2005, Lille, France, July 4-6, pp. 155–162. IEEE CS Press (2005)Google Scholar
  7. 7.
    Tudruj, M., Maśko, Ł.: Data Transfers on the Fly for Hierarchical Systems of Chip Multi–Processors. In: Wyrzykowski, R., et al. (eds.) PPAM 2011, Part I. LNCS, vol. 7203, pp. 50–59. Springer, Heidelberg (2012)Google Scholar
  8. 8.
    Masko, Ł., Dutot, P.–F., Mounié, G., Trystram, D., Tudruj, M.: Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 879–887. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Maśko, Ł., Tudruj, M.: Task Scheduling for SoC–Based Dynamic SMP Clusters with Communication on the Fly. In: 7th Int. Symp. on Parallel and Distributed Computing, ISPDC 2008, pp. 99–106 (2008)Google Scholar
  10. 10.
    Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 18(2) (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Marek Tudruj
    • 1
    • 2
  • Łukasz Maśko
    • 1
  1. 1.Institute of Computer Science of the Polish Academy of SciencesWarsawPoland
  2. 2.Polish–Japanese Institute of Information TechnologyWarsawPoland

Personalised recommendations