[1] Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. J. ACM, 46(5):720-748, 1999. [ bib | .pdf ]
[2] Umut A. Acar and Guy E. Blelloch. The data locality of work stealing. In Theory of Computing Systems, pages 1-12, 2000. [ bib | http ]
[3] A. Kukanov and M. Voss. The foundations for scalable multi-core software in intel threading building blocks. Intel Technology Journal, November 2007. [ bib | .pdf ]
[4] Stephen Olivier and Jan Prins. Scalable dynamic load balancing using upc. In ICPP '08: Proceedings of the 2008 37th International Conference on Parallel Processing, pages 123-131, Washington, DC, USA, 2008. IEEE Computer Society. [ bib | DOI | .pdf ]
[5] Stephen Olivier and Jan Prins. Scalable dynamic load balancing using upc. Parallel Processing, International Conference on, 0:123-131, 2008. [ bib | DOI | .pdf ]
[6] Larry Rudolph, Miriam Slivkin-allalouf, and Eli Upfal. A simple load balancing scheme for task allocation in parallel machines. In in Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pages 237-245. ACM Press, 1991. [ bib | http ]
[7] G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput., 7(2):279-301, 1989. [ bib | DOI | http ]
[8] Raghu Subramanian and Isaac D. Scherson. An analysis of diffusive load-balancing. In SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, pages 220-225, New York, NY, USA, 1994. ACM. [ bib | DOI | http ]
[9] Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, and Chris Wilkerson. Scheduling threads for constructive cache sharing on cmps. In In SPAA, pages 105-115. ACM Press, 2007. [ bib | http ]
[10] Guy E. Blelloch, Phillip B. Gibbons, and Yossi Matias. Provably efficient scheduling for languages with fine-grained parallelism. In In Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1-12, 1995. [ bib | http ]
[11] Guy E. Belloch, Phillip B. Gibbons, and Guy E. Blelloch. Effectively sharing a cache among threads. In In SPAA, pages 235-244. ACM Press, 2004. [ bib | http ]
[12] Ten H. Tzen and Lionel M. Ni. Trapezoid self-scheduling: A practical scheduling scheme for parallel compilers, 1993. [ bib | http ]
[13] C. D. Polychronopoulos and D. J. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel supercomputers. IEEE Trans. Comput., 36(12):1425-1439, 1987. [ bib | http ]
[14] Thomas Rauber, Matthias Korch, and Matthias Korch. A comparison of task pools for synamic load balancing of irregular algorithms. Concurr. Comput. : Pract. Exper, 16:2004, 1999. [ bib | http ]
[15] Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Bruce A. Hendrickson, James D. Teresco, Jamal Faik, Joseph E. Flaherty, and Luis G. Gervasio. New challenges in dynamic load balancing. Appl. Numer. Math, 52:2005, 2004. [ bib | http ]
[16] Milind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, and L. Paul Chew. Scheduling strategies for optimistic parallel execution of irregular programs. In SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, pages 217-228, New York, NY, USA, 2008. ACM. [ bib | DOI | .pdf ]
[17] Jaswinder Pal Singh, Chris Holt, Takashi Totsuka, Anoop Gupta, and John L. Hennessy. Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-hut, fast multipole, and radiosity. Journal Of Parallel and Distributed Computing, 27:118-141, 1995. [ bib | http ]

This file was generated by bibtex2html 1.94.