Equal allocation scheduling for data intensive applications

IEEE Transactions on Aerospace and Electronic Systems

Volumn 40, Issue 2, 2004, Pages 695-705

  Ko, Kwangil ^a   Robertazzi, Thomas G ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUAL ALLOCATION SCHEDULING; OPTIMAL SCHEDULING; SEQUENTIAL SCHEDULING;

AEROSPACE APPLICATIONS; MATHEMATICAL MODELS; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING; STORAGE ALLOCATION (COMPUTER);

MULTIPROCESSING SYSTEMS;

EID: 4444320205     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAES.2004.1310014     Document Type: Article

References (19)

1. Adler, M., Gong, Y., and Rosenberg, A. L. (2003) Optimal sharing of bags of tasks in heterogeneous clusters. In Proceedings of SPAA '03, 2003.
2. Agrawal, R., and Jagadish, H. V. (1988) Partitioning techniques for large-grained parallelism. IEEE Transactions on Computers, 37 (1988), 1627-1634.
3. Bataineh, S., and Robertazzi, T. G. (1997) Performance limits for processor networks with divisible jobs. IEEE Transactions on Aerospace and Electronic Systems, 33 (1997), 1189-1198.
4. Barlas, G. D. (1998) Collection-aware optimum sequencing of operations and closed-from solutions for the distribution of divisible load on arbitrary processor trees. IEEE Transactions on Parallel and Distributed Systems, 9 (1998), 929-941.
5. Bharadwaj, V., Ghose, D., and Robertazzi, T. G. (2003) Divisible load theory: a new paradigm for load scheduling in distributed systems. Cluster Computing, 6 (2003).
6. Bharadwaj, V., Ghose, D., Mani, V., and Robertazzi, T. G. (1996) Scheduling Divisible Loads in Parallel and Distributed Systems. Los Alamitos CA: IEEE Computer Society Press, 1996.
7. Bharadwaj, V., Ghose, D., and Mani, V. (1995) Multi-installment load distribution in tree networks with delays. IEEE Transactions on Aerospace and Electronic Systems, 31 (1995), 555-567.
8. Bharadwaj, V., Ghose, D., and Mani, V. (1994) Optimal sequencing and arrangement in distributed single-level tree networks with communication delays. IEEE Transactions on Parallel and Distributed Systems, 5 (1994), 968-976.
9. Blazewicz, J., and Drozdowski, M. (1995) Scheduling divisible jobs on hypercubes. Parallel Computing, 21 (1995), 1945-1956.
10. Cheng, Y-C., and Robertazzi, T. G. (1990) Distributed computation for a tree network with communication delays. IEEE Transactions on Aerospace and Electronic Systems, 26 (1990), 511-516.
11. Cheng, Y-C., and Robertazzi, T. G. (1988) Distributed computation with communication delays. IEEE Transactions on Aerospace and Electronic Systems, 24 (1988), 700-712.
12. Drozdowksi, M., and Glazek, W. (1999) Scheduling a divisible load in a three-dimensional mesh of processors. Parallel Computing, 25 (1999), 381-404.
13. Ghose, D., and Mani, V. (1994) Distributed computation with communication delays: Asymptotic performance analysis. Journal of Parallel and Distributed Computing, 23 (1994), 293-305.
14. Kim, H. J., Jee, G-I., and Lee, J. G. (1996) Optimal load distribution for tree network processors. IEEE Transactions on Aerospace and Electronic Systems, 32 (1996), 607-612.
15. Ko, K., and Robertazzi, T. G. (2003) Naive versus optimal scheduling for data intensive applications. Technical Report 808, Stony Brook University College of Engineering and Applied Science, 2003.
16. Robertazzi, T. G. (1993) Processor equivalence for a linear daisy chain of load sharing processors. IEEE Transactions on Aerospace and Electronic Systems, 29 (1993), 1216-1221.
17. Robertazzi, T. G. (2003) Ten reasons to use divisible load theory. Computer, 36 (2003), 63-68.
18. Sohn, J., and Robertazzi, T. G. (1996) Optimal load sharing for a divisible job on a bus network. IEEE Transactions on Aerospace and Electronic Systems, 32 (1996), 34-40.
19. Yang, Y., and Casanova, H. (2003) UMR: A multi-round algorithm for scheduling divisible workloads. In Proceedings of the International Parallel and Distributed Processing Symposium, Nice, France, Apr. 2003.