CAB: Cache Aware Bi-tier task-stealing in multi-socket multi-core architecture

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2011, Pages 722-732

  Chen, Quan ^a   Huang, Zhiyi ^b   Guo, Minyi ^a   Zhou, Jingyu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF OTAGO   (New Zealand)

Author keywords

Cache aware; Cilk; Multi socket Multi core architecture; Task stealing; Work stealing

Indexed keywords

CACHE AWARE; CILK; MULTICORE ARCHITECTURES; TASK-STEALING; WORK-STEALING;

MEMORY ARCHITECTURE; SCHEDULING;

CACHE MEMORY;

EID: 80155183145     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2011.32     Document Type: Conference Paper

References (31)

1. D. Butenhof, Programming with POSIX threads. Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA, 1997.
2. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: portable parallel programming with the message passing interface. MIT Press, 1999.
3. J. Zhang, Z. Huang, W. Chen, Q. Huang, and W. Zheng, "Maotai: View-Oriented Parallel Programming on CMT processors," in 37th International Conference on Parallel Processing, pp. 636-643, IEEE, 2008.
4. M. Frigo, C. E. Leiserson, and K. H. Randall, "The implementation of the Cilk-5 multithreaded language," in Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, (Montreal, Quebec, Canada), pp. 212-223, ACM, June 1998.
5. C. Leiserson, "The Cilk++ concurrency platform," in Proceedings of the 46th Annual Design Automation Conference, pp. 522-527, ACM, 2009.
6. J. Reinders, Intel threading building blocks. O'Reilly, 2007.
7. E. Ayguadé, N. Copty, A. Duran, J. Hoeflinger, Y. Lin, F. Massaioli, X. Teruel, P. Unnikrishnan, and G. Zhang, "The design of openmp tasks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 3, pp. 404-418, 2009.
8. D. Lea, "A Java fork/join framework," in Proceedings of the ACM 2000 conference on Java Grande, pp. 36-43, ACM, 2000.
9. J. Lee and J. Palsberg, "Featherweight X10: a core calculus for async-finish parallelism," in Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel computing, pp. 25-36, ACM, 2010.
10. G. Cong, S. Kodali, S. Krishnamoorthy, D. Lea, V. Saraswat, and T. Wen, "Solving large, irregular graph problems using adaptive work-stealing," in 37th International Conference on Parallel Processing, pp. 536-545, IEEE, 2008.
11. A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors," Journal of Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, 1992.
12. R. D. Blumofe, Executing Multithreaded Programs Efficiently. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, Sept. 1995. Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-677.
13. Y. Guo, R. Barik, R. Raman, and V. Sarkar, "Work-first and help-first scheduling policies for async-finish task parallelism," in IPDPS'09: Proceedings of the 2009 IEEE International Symposium on Parallel and Distributed Processing, pp. 1-12, IEEE Computer Society, 2009.
14. D. Hendler, Y. Lev, M. Moir, and N. Shavit, "A dynamicsized nonblocking work stealing deque," Sun Microsystems, Inc. Technical Reports; Vol. SERIES13103, p. 69, 2005.
15. D. Chase and Y. Lev, "Dynamic circular work-stealing deque," in Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, p. 28, ACM, 2005.
16. L. Wang, H. Cui, Y. Duan, F. Lu, X. Feng, and P. Yew, "An adaptive task creation strategy for work-stealing scheduling," in Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization, pp. 266-277, ACM, 2010.
17. D. Hendler and N. Shavit, "Non-blocking steal-half work queues," in Proceedings of the twenty-first annual symposium on Principles of distributed computing, p. 289, ACM, 2002.
18. M. M. Michael, M. T. Vechev, and V. A. Saraswat, "Idempotent work stealing," in PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, (New York, NY, USA), pp. 45-54, ACM, 2009.
19. K. Agrawal, C. Leiserson, and J. Sukha, "Helper locks for fork-join parallel programming," in Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel computing, pp. 245-256, ACM, 2010.
20. K. Faxén, "Efficient Work Stealing for Fine Grained Parallelism," in 2010 39th International Conference on Parallel Processing, pp. 313-322, IEEE, 2010.
21. D. Leijen, W. Schulte, and S. Burckhardt, "The design of a task parallel library," ACM SIGPLAN Notices, vol. 44, no. 10, pp. 227-242, 2009.
22. Y. Guo, J. Zhao, V. Cave, and V. Sarkar, "Slaw: a scalable locality-aware adaptive work-stealing scheduler," in the 24th IEEE International Parallel and Distributed Processing Symposium, IPDPS, 2010.
23. M. Bender and M. Rabin, "Scheduling Cilk multithreaded parallel programs on processors of different speeds," in Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, pp. 13-21, ACM, 2000.
24. S. Olivier and J. Prins, "Scalable dynamic load balancing using UPC," in 37th International Conference on Parallel Processing, pp. 123-131, IEEE, 2008.
25. J. Dinan, D. Larkins, P. Sadayappan, S. Krishnamoorthy, and J. Nieplocha, "Scalable work stealing," in Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pp. 1-11, ACM, 2009.
26. G. Long, D. Fan, and J. Zhang, "Architectural support for cilk computations on many-core architectures," in Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP '09, pp. 285-286, ACM, 2009.
27. U. Acar, G. Blelloch, and R. Blumofe, "The data locality of work stealing," Theory of Computing Systems, vol. 35, no. 3, pp. 321-347, 2002.
28. S. Chen, P. Gibbons, M. Kozuch, V. Liaskovitis, A. Ailamaki, G. Blelloch, B. Falsafi, L. Fix, N. Hardavellas, T. Mowry, et al., "Scheduling threads for constructive cache sharing on CMPs," in Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, p. 115, ACM, 2007.
29. G. Blelloch, R. Chowdhury, P. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch, "Provably good multicore cache performance for divide-and-conquer algorithms," in Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 501-510, Society for Industrial and Applied Mathematics, 2008.
30. D. Kaseridis, J. Stuecheli, and L. John, "Bank-aware Dynamic Cache Partitioning for Multicore Architectures," in 2009 International Conference on Parallel Processing, pp. 18-25, IEEE, 2009.
31. A. Kejariwal, A. Nicolau, A. Veidenbaum, U. Banerjee, and C. Polychronopoulos, "Efficient Scheduling of Nested Parallel Loops on Multi-Core Systems," in 2009 International Conference on Parallel Processing, pp. 74-83, IEEE, 2009.