CellSs: Scheduling techniques to better exploit memory hierarchy

Scientific Programming

Volumn 17, Issue 1-2, 2009, Pages 77-95

  Bellens, Pieter ^a   Perez, Josep M ^a   Cabarcas, Felipe ^b,c   Ramirez, Alex ^a,b   Badia, Rosa M ^a,d   Labarta, Jesus ^a,b  

^a BARCELONA SUPERCOMPUTING CENTER   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSIDAD DE ANTIOQUIA   (Colombia)

^d CSIC   (Spain)

Author keywords

Cell superscalar; Cell B.E.; Locality exploitation; Task scheduling

Indexed keywords

C (PROGRAMMING LANGUAGE); CELLS; CYTOLOGY; ENGINES; MEMORY ARCHITECTURE; MULTITASKING; SCHEDULING;

CELL BROADBAND ENGINE; CELL/B.E; CONCURRENT EXECUTION; LOCALITY EXPLOITATION; SCHEDULING TECHNIQUES; SIMPLE HEURISTICS; SUPERSCALAR; TASK-SCHEDULING;

CACHE MEMORY;

EID: 60649097766     PISSN: 10589244     EISSN: None     Source Type: Journal    
DOI: 10.3233/SPR-2009-0272     Document Type: Article

References (45)

1. T.W. Ainsworth and T.M. Pinkston, On characterizing performance of the Cell Broadband Engine element interconnect bus, in: Proceedings of the First International Symposium on Networks-on-Chip, Princeton, NJ, 2007.
2. K. Asanovic, R. Bodik, B.C. Catanzaro, J.J. Gebis, P. Husbands, K. Keutzer, D.A. Patterson et al., The landscape of parallel computing research: A view from Berkeley, Technical Report EECS-2006-183, University of California at Berkeley, 2006.
3. N.C. Audsley, Deadline monotonic scheduling, Technical Report YCS 146, Department of Computer Science, University of York, October 1990.
4. N.C. Audsley, Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, Technical report, Department of Computer Science, University of York, 1991.
5. E. Ayguadé, N. Copty, A. Duran, J. Hoeflinger, Y. Lin and G. Zhang, A proposal for task parallelism in OpenMP, in: Proceedings of the 3rd International Workshop on OpenMP, Reims, France, June 2006.
6. J. Balart, M. Gonzalez, X. Martorell, E. Ayguade, Z. Sura, T. Chen, T. Zhang and K. O'brien, A novel asynchronous software cache implementation for the Cell-BE processor, in: Proceedings of the Workshop on Languages and Compilers for Parallel Computing, Urbana, IL, 2007.
7. P. Bellens, J.M. Perez, R.M. Badia and J. Labarta, CellSs: A programming model for the Cell BE architecture, in: Proceedings of the ACM/IEEE SC 2006 Conference, Tampa, FL, November 2006.
8. E. Chan, E.S. Quintana-Orti, G. Quintana-Orti and R. van de Geijn, Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures, in: Proceedings of the 19th Annual ACM symposium on Parallel Algorithms and Architectures, San Diego, CA, 2007, pp. 116-125.
9. L.F. Chao and E. Sha, Scheduling data-flow graphs via retiming and unfoloding, IEEE Transactions on Parallel and Distributed Systems 8(12) (1997), 1259-1267.
10. H. Chen, B. Shirazi and J. Marquis, Performance evaluation of a novel scheduling method: Linear clustering with task duplication, in: Proceedings of the 2nd International Conference on Parallel and Distributed Systems, Taiwan, December 1993.
11. P. Chretienne, Task scheduling over distributed memory machines, in: Proceedings of the International Workshop on Parallel and Distributed Algorithms, Chateau De Bonas, Gers, France, 1989.
12. E. Coffman and R. Graham, Optimal scheduling for twoprocessor systems, Acta Informatica 1 (1972), 200-213.
13. M. Cosnard and E. Jeannot, Compact DAG representation and its dynamic scheduling, Journal of Parallel and Distributed Computing 58(3) (1999), 487-514.
14. A. Duran, J.M. Perez, E. Ayguade, R.M. Badia and J. Labarta, Extending the OpenMP tasking model to allow dependent tasks, in: Proceedings of the 4th International Workshop on OpenMP, Purdue University, West Lafayette, IN, 2008.
15. M. Frigo, C.E. Leiserson and K.H. Randall, The implementation of the Cilk-5 multithreaded language, SIGPLAN Notices 33(5) (1998), 212-223.
16. A. Gerasoulis and T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Transactions on Parallel and Distributed Systems 4(6) (1993), 686-701.
17. P.B. Gibbons and S.Muchnick, Efficient instruction scheduling for a pipelined architecture, in: Proceedings of the SIGPLAN Symposium on Compiler construction, Palo Alto, CA, 1986.
18. M. Gonzalez, E. Ayguadé, X. Martorell and J. Labarta, Exploiting pipelined executions in OpenMP, in: Proceedings of the 32nd Annual International Conference on Parallel Processing, Kaohsiung, Taiwan, October 2003, pp. 153-160.
19. B. Hamidzadeh, L.Y. Kit and D.J. Lilja, Dynamic task scheduling using online optimization, IEEE Transactions on Parallel and Distributed Systems 11(11) (2000), 1151-1163.
20. B. Hamidzadeh and D.J. Lilja, Dynamic scheduling strategies for shared-memory multiprocessors, in: Proceedings of the International Conference on Distributed Computing Systems, Hong-Kong, 1996.
21. T. Hu, Parallel sequencing and assemby line problems, Operation Research 9 (1961), 841-848.
22. IBM, Cell Broadband Engine Architecture, version 1.02, IBM Technical Document.
23. IBM, Cell Broadband Engine Programming Handbook, version 1.1, International Business Machines Corporation, Sony Computer Entertainment Incorporated, Toshiba Corporation, 2007.
24. D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure and M. Wolfe, Dependence graphs and compiler optimizations, in: Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Williamsburg, VA, 1981, pp. 207-218.
25. Y. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys 9(4) (1999), 406-471.
26. J. Labarta, S. Girona, V. Pillet, T. Cortes and L. Gregoris, DiP: A parallel program development environment, in: Proceedings of the 2nd International EuroPar Conference (EuroPar'96), Lyon, France, 1996.
27. C. Liu and J. Layland, Scheduling algorithms for multiprogramming in a hard real-time environment, Journal of the ACM 20(1) (1973), 46-61.
28. P. Liu, J.-J. Wu and C.-H. Yang, Locality-preserving dynamic load balancing for data-parallel applications on distributedmemory multiprocessors, Journal of Information Science and Engineering 18(6) (2002), 1037-1048.
29. G. Manimaran and C.S.R. Murthy, An efficient dynamic scheduling algorithm for multiprocessor real-time systems, IEEE Transactions on Parallel and Distributed Systems 9(3) (1998), 312-319.
30. R.R. Muntz and E.G. Coffman, Preemptive scheduling of realtime tasks on multiprocessor systems, Journal of the ACM 17(2) (1970), 324-338.
31. P.K. Murthy and E. Lee, On the optimal blocking factor for blocked, non-overlapped schedules, Memo No. UCB/ERL M94/46, Electronics Research Lab., University of California, Berkeley, CA, 1994.
32. J. Noguera and R.M. Badia, Dynamic run-time HW/SW scheduling techniques for reconfigurable architectures, in: Proceedings of the Tenth International Symposium on Hardware/ Software Codesign, Estes Park, CO, 2002.
33. M.A. Palis and J. Liou, Task clustering and scheduling for distributed memory parallel architectures, IEEE Transactions on Parallel and Distributed Systems 7(1) (1996), 46-55.
34. C. Papadimitriou and M. Yannakakis, Scheduling intervalordered tasks, SIAM Journal of Computing 8(3) (1979), 405-409.
35. K. Parhi and L. Lucke, Data-flow transformations for critical path time reduction in high-level DSP synthesis, IEEE Transactions on Computer-Aided Design of Integrated Circuits and System 12(7) (1993), 1063-1068.
36. K. Parhi and D. Messerschmitt, Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding, IEEE Transactions on Computers 40(2) (1991), 178-195.
37. J.M. Perez, P. Bellens, R.M. Badia and J. Labarta, CellSs: Programming the Cell/B.E. made easier, IBM Journal of R&D 51(5) (2007), 593-604.
38. V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, MIT Press, Cambridge, MA, USA, 1989.
39. H. Servat, C. Gonzalez-Alvarez, X. Aguilar, D. CabreraBenitez and D. Jimenez-Gonzalez, Drug design on the CellBroadband Engine, in: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques, Brasov, Romania, 2007.
40. H. Servat, C. Gonzalez-Alvarez, X. Aguilar, D. Cabrera-Benitez and D. Jimenez-Gonzalez, Drug design issues on the Cell BE, in: Proceedings of the International Conference on High Performance and Embedded Architectures and Compilers, Paphos, Cyprus, 2008.
41. The community of OpenMP users, researchers, tool developers and provider website, http://www.compunity.org/.
42. R.M. Tomasulo, An efficient algorithm for exploiting multiple arithmetic units, IBM Journal of Research and Development 11(1) (1967), 25-33.
43. T. Yang and A. Gerasoulis, A fast static scheduling algorithm for DAGs on an unbounded number of processors, in: Proceedings of the ACM/IEEE Conference on Supercomputing, Albuquerque, NM, 1991, pp. 633-642.
44. W. Zhao, K. Ramamritham and J.A. Stanovic, Preemptive scheduling under time and resource constraints, IEEE Transactions on Computers 36(8) (1987), 949-960.
45. H.B. Zhou, Scheduling DAGs on a bounded number of processors, in: Proceedings of PDPTA, Sunnyvale, CA, Vol. 2, August 1996, pp. 823-834.