1. K.P. Belkhale, P. Banerjee, A scheduling algorithm for parallelizable dependent tasks, in: Proc. of Int. Parallel Processing Symposium, Anaheim, CA, April 1991, pp. 500–506.
2. K.P. Belkhale, P. Banerjee, An approximation algorithm for the partitionable independent task scheduling problem, in: Proc. of 19th Int. Conference on Parallel Processing, Aug. St. Charles, IL, August 1990, pp. 72–75.
3. S. Chakrabarti, J. Demmel, K. Yelick, Modeling the benefits of mixed data and task parallelism, in:; Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, CA, July 1995, pp. 74–83.
4. Models and scheduling algorithms for mixed data and task parallel programs;Chakrabarti;Journal of Parallel and Distributed Computing,1997
5. Fortran M: a language for modular parallel programming;Foster;Journal of Parallel and Distributed Computing,1995