1. T. Adam, K. Chandy, and J. Dickson. A comparison of list schedulers for parallel processing systems. Communications of the ACM, 17(12):685–690, 1974.
2. A. Aggarwal, A.K. Chandra, and M. Snir. On communication latency in PRAM computations. Technical Report RE RC 14973, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA, September 1989.
3. I. Ahmad, Y. Kwok, and M. Wu. Analysis, evaluation and comparison of algorithms for scheduling task graphs to parallel processors. In Proceedings of the 1996 International Symposium on Parallel Architecture, Algorithms and Networks, Beijing, China, June 1996.
4. I. Ahmad and Y K Kwok. A new approach to scheduling parallel programs using task duplication. In K.C. Tai, editor, Proceedings ofthe International Conference on Parallel Processing (ICPP ’94), volume 2, pages 47–51, St. Charles, Illinois, USA., August 1994.
5. A. Alexandrov, M. Ionescu, K.E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model — one step closer towards a realistic model for parallel computation. The Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA’95), July 1995. Also as TRCS95–09 — Department of Computer Science — University of Santa Barbara, CA, USA.