Scheduling nonlinear computational loads

IEEE Transactions on Aerospace and Electronic Systems

Volumn 44, Issue 3, 2008, Pages 1169-1182

  Hung, Jui Tsun ^a   Robertazzi, Thomas G ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; COMPUTATIONAL COMPLEXITY; IMAGE PROCESSING; SATELLITE IMAGERY; SCHEDULING;

COMPUTATION TIMES; COMPUTATIONAL LOADS; ITERATIVE SOLUTIONS; LOAD DISTRIBUTIONS; NON LINEARITIES; OPTIMAL LOADS; QUADRATIC NON LINEARITIES; SATELLITE IMAGE PROCESSING; SCHEDULING MODELS; SENSOR DATA PROCESSING; SPECTRUM COMPUTATIONS; SPEED-UP; SUPERLINEAR SPEEDUPS; TREE NETWORKS;

DATA PROCESSING;

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

References (31)

1. Bharadwaj, V., Ghose, D., Mani, V., and Robertazzi, T. G. Scheduling Divisible Loads in Parallel and Distributed Systems. Los Alamitos, CA: IEEE Computer Society Press, 1996.
2. Hung, J. T., Kim, H. J., and Robertazzi, T. G. Scalable scheduling in parallel processors. In Proceedings of the 2002 Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, 2002.
3. Hung, J. T., and Robertazzi, T. G. Scalable scheduling for clusters and grids using cut through switching. International Journal of Computers and their Applications, 26 (2004), 147-156.
4. Drozdowksi, M., and Wolniewicz, P. Out-of-core divisible load processing. IEEE Tranactions on Parallel and Distributed Systems, 14 (2003), 1048-1056.
5. Bharadwaj, V., Ghose, D., and Robertazzi, T. G. Divisible load theory: A new paradigm for load scheduling in distributed systems. Cluster Computing, 6 (2003), 7-18.
6. Cheng, Y. C., and Robertazzi, T. G. Distributed computation with communication delays. IEEE Transactions on Aerospace and Electronic Systems, 24 (1988), 700-712.
7. Barlas, G. D. Collection aware optimum sequencing of operations and closed form solutions for the distribution of divisible load on arbitrary processor trees. IEEE Transactions on Parallel and Distributed Systems, 9 (1998), 429-441.
8. Bataineh, S., and Robertazzi, T. G. Bus oriented load sharing for a network of sensor driven processors. IEEE Transactions on Systems, Man and Cybernetics, 21 (1991), 1202-1205.
9. Blazewicz, J., and Drozdowski, M. Scheduling divisible jobs on hypercubes. Parallel Computing, 21 (1995), 1945-1956.
10. Beaumont, O., Carter, L., Ferrante, J., Legrand, A., and Robert, Y. Bandwidth-centric allocation of independent tasks on heterogeneous platforms. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'02), Fort Lauderdale, FL, 2002.
11. Yang, Y., and Casanova, H. UMR: A multi-round algorithm for scheduling divisible workloads. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, 2003.
12. Kim, H. J. A novel load distribution algorithm for divisible loads. Cluster Computing, 6 (2003), 41-46.
13. Piriyakumar, D. A. L., and Murthy, C. S. R. Distributed computation for a hypercube network of sensor-driven processors with communication delays including setup time. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 28 (1998), 245-251.
14. Li, K. Parallel processing of divisible loads on partitionable static interconnection networks. Cluster Computing, 6 (2003), 47-56.
15. Kim, H. J., Jee, G.-I., and Lee, J. G. Optimal load distribution for tree network processors. IEEE Transactions on Aerospace and Electronic Systems, 32 (1996), 607-612.
16. Blazewicz, J., Drozdowski, M., Guinand, F., and Trystram, D. Scheduling a divisible task in a 2-dimensional mesh. Discrete Applied Mathematics, (1999), 35.
17. Glazek, W. A multistage load distribution strategy for three dimensional meshes. Cluster Computing, 6 (2003), 31-40.
18. Bharadwaj, V., Ghose, D., and Mani, V. Multi-installment load distribution in tree networks with delay. IEEE Transactions on Aerospace and Electronic Systems, 31 (1995), 555-567.
19. Dutot, P.-F. Divisible load on heterogeneous linear array. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, 2003.
20. Robertazzi, T. G. Ten reasons to use divisible load theory. Computer 31 (2003), 63-68.
21. Adler, M., Gong, Y., and Rosenberg, A. L. Optimal sharing of bags of tasks in heterogeneous clusters. Presented at the Symposium on Parallelism in Algorithms and Architectures (SPAA'03), San Diego, CA, 2003.
22. Hung, J. T., and Robertazzi, T. G. Scheduling nonlinear computational loads: Analysis and proof. Stony Brook University College of Engineering and Applied Science, CEAS Technical Report 823, 2006.
23. Hung, J. T., and Robertazzi, T. G. Divisible load cut through switching in sequential tree networks. IEEE Transactions on Aerospace and Electronic Systems, 40 (2004), 968-982.
24. Robertazzi, T. G. Processor equivalence for a linear daisy chain of load sharing processors. IEEE Transactions on Aerospace and Electronic Systems, 29 (1993), 1216-1221.
25. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. Introduction to Algorithms. New York: McGraw-Hill, 1998.
26. Bharadwaj, V., and Viswanadham, N. Suboptimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks. IEEE Transactions on System, Man, and Cybernetics - Part A: Systems and Humans, 30 (2000), 680-691.
27. Beaumont, O., Casanova, H., Legrand, A., Robert, Y., and Yang, Y. Scheduling divisible loads on star and tree networks: Results and open problems. IEEE Transactions on Parallel Distributed Systems, 16 (2005), 207-218.
28. Beaumont, O., Legrand, A., and Robert, Y. Scheduling divisible workloads on heterogeneous platforms. Parallel Computing, 29 (2003), 1121-1132.
29. Drozdowski, M., Lawenda, M., and Guinand, F. Scheduling multiple divisible loads. The International Journal of High Performance Computing Applications, 20 (2006), 19-30.
30. Drozdowski, M., and Wolniewicz, P. Optimum divisible load scheduling on heterogeneous stars with limited memory. European Journal of Operational Research, 172 (2006), 545-559.
31. Drozdowski, M., and Lawenda, M. The combinatorics in divisible load scheduling. Foundations of Computing and Decision Sciences, 30 (2005), 297-308.