Compendium

Knowledge base

A growing reference for divisible load theory: the model, the vocabulary, the methods and the literature. Pick a section from the menu. Terms defined in the glossary are linked throughout the portal.

Publications & references

427 references in IEEE style, sourced from a BibTeX file. Search, filter and export below.

Showing 427 · export downloads the full set.

Foundations

  1. [1] B. Veeravalli, Accelerating Divisible Load Processing Through Machine Learning: A Practical Framework for Large-Scale Workloads, arXiv preprint, 2026. DOI:10.48550/ARXIV.2605.23247
  2. [2] B. Veeravalli, A Multi-Port Concurrent Communication Model for Handling Compute Intensive Tasks on Distributed Satellite System Constellations, arXiv:2601.01031, 2026. [link]
  3. [3] M. Drozdowski, Divisible load scheduling, presented at the Scheduling Seminar (Z. Hanzálek), Oct. 23, 2024. DOI:10.1201/9781420072747-C8
  4. [4] S. M. Kazemi, S. Ghanbari, M. Kazemi, and M. Othman, Optimum scheduling in fog computing using the Divisible Load Theory (DLT) with linear and nonlinear loads, Comput. Networks., vol. 220, pp. 109483, 2023. DOI:10.1016/J.COMNET.2022.109483
  5. [5] L. Tang and H. Qin, Divisible Task Offloading for Multiuser Multiserver Mobile Edge Computing Systems Based on Deep Reinforcement Learning, IEEE Access, vol. 11, pp. 83507-83522, 2023. DOI:10.1109/ACCESS.2023.3302528
  6. [6] X. Wang, B. Veeravalli, K. Wu, and X. Song, Extension of Divisible-Load Theory from Scheduling Fine-Grained to Coarse-Grained Divisible Workloads on Networked Computing Systems, Mathematics, vol. 11, no. 7, pp. 1752, 2023. DOI:10.3390/math11071752
  7. [7] M. Drozdowski, Divisible load theory - from basics to applications, presented at the 2nd Int. Conf. Distrib. Comput. High Perform. Comput. (DCHPC), Qom, Iran, Mar. 2-3, 2022. [link]
  8. [8] B. Deng and W. Li, Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks, in Proc. NCTCS, pp. 263-272, 2022. DOI:10.1007/978-981-19-8152-4_19
  9. [9] S. Wang, Y. Lu, F. Chu, and J. Yu, Scheduling with divisible jobs and subcontracting option, Comput. Oper. Res., vol. 145, pp. 105850, 2022. DOI:10.1016/J.COR.2022.105850
  10. [10] S. Ghanbari and M. Othman, A multi-criteria approach to time cheating in the divisible load scheduling, Iran J. Comput. Sci., vol. 4, no. 4, pp. 253-264, 2021. DOI:10.1007/S42044-020-00079-7
  11. [11] Y. Cao, F. Wu, and T. G. Robertazzi, Integrating Amdahl-like Laws and Divisible Load Theory, Parallel Process. Lett.:1-2150008:10, vol. 31, no. 2, pp. 2150008, 2021. DOI:10.1142/S0129626421500080
  12. [12] S. Ghanbari and M. Othman, Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process, in Proc. SCDM, pp. 403-416, 2020. DOI:10.1007/978-3-030-36056-6_38
  13. [13] M. Kazemi, S. Ghanbari, and M. Kazemi, Divisible Load Framework and Close Form for Scheduling in Fog Computing Systems, in Proc. SCDM, pp. 323-333, 2020. DOI:10.1007/978-3-030-36056-6_31
  14. [14] F. Wu, Y. Cao, and T. G. Robertazzi, Optimal Divisible Load Scheduling for Resource-Sharing Network, arXiv preprint, 2019. DOI:10.48550/arXiv.1902.01898
  15. [15] Y. Cao, F. Wu, and T. G. Robertazzi, Scheduling and Trade-off Analysis for Multi-Source Multi-Processor Systems with Divisible Loads, arXiv preprint, 2019. [link]
  16. [16] N. L. Hazekamp, B. Tovar, and D. Thain, Dynamic Sizing of Continuously Divisible Jobs for Heterogeneous Resources, in Proc. eScience, pp. 178-187, 2019. DOI:10.1109/ESCIENCE.2019.00026
  17. [17] H. Xuan, S. Wei, W. Tong, D. Liu, and C. Qi, Fault-Tolerant Scheduling Algorithm With Re-Allocation for Divisible Task, IEEE Access, vol. 6, pp. 73147-73157, 2018. DOI:10.1109/ACCESS.2018.2881268
  18. [18] M. Zeng and V. Fodor, Distributing dynamic divisible loads, in Proc. Networking, pp. 1-2, 2017. DOI:10.23919/IFIPNETWORKING.2017.8264889
  19. [19] Q. Baert, A. Caron, M. Morge, and J. Routier, Negotiation Strategy of Divisible Tasks for Large Dataset Processing, in Proc. EUMAS/AT, pp. 370-384, 2017. DOI:10.1007/978-3-030-01713-2_26
  20. [20] H. Huang, Divisible load scheduling algorithm in a virtual distributed computing system. 2016. DOI:10.32657/10356/68812
  21. [21] H. Xuan, Y. Wang, S. Hao, and X. Wang, Multi-objective scheduling for divisible load in heterogeneous distributed system, in Proc. CEC, pp. 3378-3384, 2016. DOI:10.1109/CEC.2016.7744217
  22. [22] X. Wang, Y. Wang, and J. Lai, Divisible-Load Scheduling for Network-Based Computing Systems with Processor Startup Overheads and Release Times, in Proc. CIS, pp. 9-13, 2016. DOI:10.1109/CIS.2016.0012
  23. [23] J. Berlińska and M. Drozdowski, Scheduling multilayer divisible computations, RAIRO Oper. Res., vol. 49, no. 2, pp. 339-368, 2015. DOI:10.1051/ro/2014050
  24. [24] J. S. Brandão, T. F. Noronha, M. G. C. Resende, and C. C. Ribeiro, A biased random-key genetic algorithm for single-round divisible load scheduling, Int. Trans. Oper. Res., vol. 22, no. 5, pp. 823-839, 2015. DOI:10.1111/ITOR.12178
  25. [25] K. Wang and T. G. Robertazzi, Scheduling divisible loads with nonlinear communication time, IEEE Trans. Aerosp. Electron. Syst., vol. 51, no. 3, pp. 2479-2485, 2015. DOI:10.1109/TAES.2015.130677
  26. [26] B. Hezarkhani and W. Kubiak, Decentralized subcontractor scheduling with divisible jobs, J. Sched., vol. 18, no. 5, pp. 497-511, 2015. DOI:10.1007/S10951-015-0432-2
  27. [27] X. Wang, Y. Wang, and K. Meng, A New Genetic Algorithm for Release-Time Aware Divisible-Load Scheduling, in Proc. CIS, pp. 134-138, 2014. DOI:10.1109/CIS.2014.97
  28. [28] M. Balasubramaniam, I. Banicescu, and F. M. Ciorba, Scalability Analysis and Evaluation of Divisible Load Scheduling, in Proc. ICPP Workshops, pp. 37-44, 2014. DOI:10.1109/ICPPW.2014.18
  29. [29] M. Balasubramaniam, I. Banicescu, and F. M. Ciorba, Robustness Prediction and Evaluation of Divisible Load Scheduling on Computing Systems with Unpredictable Variations, in Proc. ISPDC, pp. 170-177, 2014. DOI:10.1109/ISPDC.2014.26
  30. [30] K. Kobert, T. Flouri, A. J. Aberer, and A. Stamatakis, The Divisible Load Balance Problem and Its Application to Phylogenetic Inference, in Proc. WABI, pp. 204-216, 2014. DOI:10.1007/978-3-662-44753-6_16
  31. [31] M. Wang, X. Wang, K. Meng, and Y. Wang, New Model and Genetic Algorithm for Divisible Load Scheduling in Heterogeneous Distributed Systems, International Journal of Pattern Recognition and Artificial Intelligence, vol. 27, no. 7, 2013. DOI:10.1142/s0218001413590052
  32. [32] O. Beaumont, H. Larcheveque, and L. Marchal, Non-Linear Divisible Loads: There is no Free Lunch, in 27th IEEE International Parallel and Distributed Processing Symposium, 2013. DOI:10.1109/IPDPS.2013.94
  33. [33] M. Balasubramaniam and F. M. Ciorba, Analyzing the Robustness of Scheduling Algorithms using Divisible Load Theory on Heterogenous Systems, in IEEE 12th International Symposium on Parallel and Distributed Computing, pp. 45-52, 2013. DOI:10.1109/ISPDC.2013.15
  34. [34] S. Ghanbari, M. Othman, W. J. Leong, and M. R. A. Bakar, Multi-Criteria Based Algorithm for Scheduling Divisible Load, in Proc. DaEng, pp. 547-554, 2013. DOI:10.1007/978-981-4585-18-7_61
  35. [35] A. Ilic and L. Sousa, On Realistic Divisible Load Scheduling in Highly Heterogeneous Distributed Systems, in Proc. PDP, pp. 426-433, 2012. DOI:10.1109/PDP.2012.56
  36. [36] K. Choi and T. G. Robertazzi, An exhaustive approach to release time aware divisible load scheduling, Int. J. Internet Distrib. Comput. Syst., vol. 1, no. 2, 2011.
  37. [37] C. F. Gamboa and T. G. Robertazzi, Simple performance bounds for multicore and parallel channel systems, Parallel Process. Lett., vol. 21, no. 4, pp. 439-459, 2011. DOI:10.1142/s012962641100031x
  38. [38] M. Abouelela and M. El-Darieby, Towards Network-Aware Divisible Load Theory for Optical Grids, in Proc. HPCC, pp. 425-431, 2011. DOI:10.1109/HPCC.2011.62
  39. [39] M. Drozdowski and Ł. Wielebski, Isoefficiency maps for divisible computations, IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 6, pp. 872-880, 2010. DOI:10.1109/TPDS.2009.128
  40. [40] S. Suresh, C. Run, H. J. Kim, and T. G. Robertazzi, Scheduling second order computational load in master-slave paradigm, IEEE Trans. Aerosp. Electron. Syst., 2010. DOI:10.1109/TAES.2012.6129670
  41. [41] A. Shokripour, M. Othman, and H. Ibrahim, A new algorithm for divisible load scheduling with different processor available times. Lecture Notes in Computer Science, Springer Berlin/Heidelberg, 2010. DOI:10.1007/978-3-642-12145-6_23
  42. [42] M. Drozdowski, Scheduling for Parallel Processing. London, U.K.: Springer, 2009. DOI:10.1007/978-1-84882-310-5
  43. [43] T. T. Chin, B. Veeravalli, and J. Jia, Handling Large-Size Discrete Wavelet Transform on Network-Based Computing Systems: Parallelization via Divisible Load Paradigm, J. Parallel Distrib. Comput., vol. 69, no. 2, pp. 143-152, 2009. DOI:10.1016/j.jpdc.2008.08.007
  44. [44] A. Shokripour and M. Othman, A review on divisible load theory applications, MASAUM Journal of Reviews and Surveys (MJRS), vol. 1, no. 2, pp. 146-153, 2009. DOI:10.1109/ICIME.2009.59
  45. [45] E. R. T. Abib and C. C. Ribeiro, New heuristics and integer programming formulations for scheduling divisible load tasks, in Proc. CISched, pp. 54-61, 2009. DOI:10.1109/SCIS.2009.4927015
  46. [46] A. Benoit, L. Marchal, J. Pineau, Y. Robert, and F. Vivien, Resource-aware allocation strategies for divisible loads on large-scale systems, in Proc. IPDPS, pp. 1-4, 2009. DOI:10.1109/IPDPS.2009.5160912
  47. [47] K. Choi and T. G. Robertazzi, An Exhaustive Approach to Release Time Aware Divisible Load Scheduling, in Proc. PDPTA, pp. 145-151, 2009. DOI:10.1201/9781420072747-14
  48. [48] J. Berlinska, Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads, in Proc. PPAM, pp. 1-10, 2009. DOI:10.1007/978-3-642-14403-5_1
  49. [49] T. Robertazzi, Divisible load scheduling, [Online]. Available: http://www.ee.sunysb.edu/tom/dlt.html, 2009.
  50. [50] A. Shokripour and M. Othman, Survey on Divisible Load Theory and its Applications, in 2009 International Conference on Information Management and Engineering (ICIME), Kuala Lumpur, Malaysia, 2009. DOI:10.1109/ICIME.2009.59
  51. [51] J. T. Hung and T. G. Robertazzi, Scheduling nonlinear computational loads, IEEE Trans. Aerosp. Electron. Syst., 2008. DOI:10.1109/TAES.2008.4655372
  52. [52] S. Bataineh, Divisible Load Distribution in a Network of Processors, Journal of Interconnection Networks (JOIN), issue 1/2, March and, vol. 9, pp. 31-51, 2008. DOI:10.1142/s021926590800214x
  53. [53] K. Aida and H. Casanova, Scheduling mixed-parallel applications with advance reservations, in 17th International Symposium on High Performance Distributed Computing (HPDC), pp. 65-74, 2008.
  54. [54] S. Mingsheng, Optimal algorithm for scheduling large divisible workload on heterogeneous system, Applied Mathematical Modelling, vol. 32, pp. 1682-1695, 2008.
  55. [55] T. G. Robertazzi, Networks and Grids: Technology and Theory. New York, NY, USA: Springer, 2007. DOI:10.1007/978-0-387-68235-8
  56. [56] T. E. Carroll and D. Grosu, Divisible Load Scheduling: An Approach using Coalitional Games, in Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07), July, pp 36, 2007. DOI:10.1109/ISPDC.2007.16
  57. [57] P. Thysebaert, B. Volckaert, M. D. Leenheer, F. D. Turck, B. Dhoedt, and P. Demeester, Dimensioning and on-line scheduling in Lambda Grids using divisible load concepts, J. Supercomput, vol. 42, no. 1, pp. 59-82, 2007. DOI:10.1007/S11227-006-0036-X
  58. [58] M. Abdullah, M. Othman, H. Ibrahim, and S. Subramaniam, An Integrated Approach for Scheduling Divisible Load on Large Scale Data Grids, in Proc. ICCSA, pp. 748-757, 2007. DOI:10.1007/978-3-540-74472-6_61
  59. [59] A. Kamthe and S. Lee, Stochastic Approach to Scheduling Multiple Divisible Tasks on a Heterogeneous Distributed Computing System, in Proc. IPDPS, pp. 1-11, 2007. DOI:10.1109/IPDPS.2007.370329
  60. [60] Z. Zeng and B. Veeravalli, Distributed Scheduling Strategy for Divisible Loads on Arbitrarily Configured Distributed Networks using Load Balancing via Virtuial Routing, J. Parallel Distrib. Comput., vol. 66, pp. 1404-1418, 2006. DOI:10.1016/j.jpdc.2006.05.007
  61. [61] D. Ghose and H. J. Kim, A Generalized Linear Programming Based Approach to Optimal Divisible Load Scheduling [book chapter] in Distributed Computing and Internet Technology (Eds. S.K. Madria et. al.), Lecture Notes in Computer Science, Springer Verlag , Berlin, Germany, LNCS 4317, 2006, pp. 235-248.. 2006. DOI:10.1007/11951957_22
  62. [62] M. Drozdowski, M. Lawenda, and F. Guinand, Scheduling Multiple Divisible Loads, Int. J. High Perform. Comput. Appl., vol. 20, no. 1, pp. 19-30, 2006. DOI:10.1177/1094342006061879
  63. [63] K. N. Vikram and V. Vasudevan, Scheduling divisible loads on partially reconfigurable hardware, in Proc. FCCM, pp. 289-290, 2006. DOI:10.1109/FCCM.2006.63
  64. [64] O. Beaumont, L. Marchal, V. Rehn, and Y. Robert, FIFO scheduling of divisible loads with return messages under the one-port model, in Proc. IPDPS, 2006. DOI:10.1109/IPDPS.2006.1639390
  65. [65] M. Drozdowski and M. Lawenda, The combinatorics in divisible load scheduling, Found. Comput. Decis. Sci., vol. 30, no. 4, pp. 297-308, 2005. [link]
  66. [66] Y. Yang, K. Raadt, and H. Casanova, Multiround Algorithms for Scheduling Divisible Loads, IEEE Transcations on Parallel and Distributed Systems, vol. 16, no. 11, pp. 1092-1102, 2005. DOI:10.1109/TPDS.2005.139
  67. [67] S.M. Bataineh, Towards Analytical Solution to Task Allocation, Processor Assignment, and Performance Evaluation of Network of Processors, J. Parallel Distrib. Comput., vol. 65, pp. 29-47, 2005. DOI:10.1016/j.jpdc.2004.09.008
  68. [68] P. Thysebaert, F. Turck, B. Dhoedt, and P. Demeester, Using Divisible Load Theory to Dimension Optical Transport Networks Computational Grids, in Proc. of Optical Fibre Communication Conference, OFC, 2005. DOI:10.1109/OFC.2005.192680
  69. [69] D. Grosu and T. E. Carroll, A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems, in Proc. ISPDC, pp. 83-90, 2005. DOI:10.1109/ISPDC.2005.9
  70. [70] T. Ferreto and C. A. F. D. Rose, Scheduling Divisible Workloads Using the Adaptive Time Factoring Algorithm, in Proc. ICA3PP, pp. 232-239, 2005. DOI:10.1007/11564621_26
  71. [71] D. Lee and R. S. Ramakrishna, Inter-round Scheduling for Divisible Workload Applications, in Proc. ICA3PP, pp. 225-231, 2005. DOI:10.1007/11564621_25
  72. [72] M. Drozdowski and Ł. Wielebski, Efficiency of divisible load processing, in Parallel Processing and Applied Mathematics (PPAM), ser. LNCS 3019. Springer., pp. 175-180, 2004. DOI:10.1007/978-3-540-24669-5_23
  73. [73] K. Li, Improved Methods for Divisible Load Distribution on k-Dimensional Meshes using Pipelined Communications, IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 12, pp. 1250-1261, 2003. DOI:10.1109/IPDPS.2003.1213185
  74. [74] B. Kreaseck, L. Carter, H. Casanova, and J. Ferrante, Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-task Applications, in Proc. International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France., 2003. DOI:10.1109/IPDPS.2003.1213104
  75. [75] T. G. Robertazzi, Ten Reasons to Use Divisible Load Theory, Computer, vol. 36, no. 5, pp. 63-68, 2003. DOI:10.1109/MC.2003.1198238
  76. [76] L. Dong, L. H. Ngoh, and J. G. Tan, Scheuduling Strategies of Divisible Loads in DIN Networks, in Proc. Euro-Par., pp. 236-240, 2003. DOI:10.1007/978-3-540-45209-6_36
  77. [77] F. Drews, O. Kao, U. Rerrer, and K. H. Ecker, Extending the Divisible Task Model for Load Balancing in Parallel and Distributed Systems, in Proc. PDPTA, pp. 493-497, 2003. DOI:10.1016/s0927-5452(04)80030-3
  78. [78] Y. Yang and H. Casanova, RUMR: Robust Scheduling for Divisible Workloads, in Proc. HPDC, pp. 114-125, 2003. DOI:10.1109/HPDC.2003.1210021
  79. [79] B. Veeravalli, D. Ghose, and T. G. Robertazzi, New challenges of parallel job scheduling, in Lecture Notes in Computer Science, pp. 1-23, 2003.
  80. [80] J. T. Hung, H. J. Kim, and T. G. Robertazzi, Scalable scheduling in parallel processors, in Proc. Conf. Inf. Sci. Syst. (CISS), Princeton, NJ, USA, 2002.
  81. [81] N. Comino and L. Narasimhan, A Novel Data Distribution Technique for Host- Clent Type Parallel Applications, IEEE Transactions on Parallel and Distributed Applications, vol. 13, no. 2, pp. 97-110, 2002. DOI:10.1109/71.983939
  82. [82] G. Li and D. Zhang, Distributing and Scheduling Divisible Task on Parallel Communicating Processors, J. Comput. Sci. Technol., vol. 17, no. 6, pp. 788-796, 2002. DOI:10.1007/BF02960769
  83. [83] D. T. Altilar and Y. Paker, Optimal scheduling algorithms for communication constrained parallel processing, in Lecture Notes in Computer Science, pp. 197-206, 2002.
  84. [84] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 2001.
  85. [85] Handbook on Parallel and Distributed Processing. Springer, 2000. DOI:10.1007/978-3-662-04303-5
  86. [86] J. Blazewicz, M. Drozdowski, and K. Ecker, Management of Resources in Parallel Systems, Handbook on Parallel and Distributed Processing, pp. 263-341, 2000. DOI:10.1007/978-3-662-04303-5_6
  87. [87] K. G. Shin and S. K. Yun, On Load Balancing in Multicomputer/Distributed Systems Equipped with Circuit or Cut-Through Switching Capability, IEEE Trans. Comput., vol. 49, no. 9, 2000. DOI:10.1109/12.869325
  88. [88] J. Błażewicz, M. Drozdowski, and M. Markiewicz, Divisible task scheduling - concept and verification, Parallel Comput., vol. 25, no. 1, pp. 87-98, 1999. DOI:10.1016/s0167-8191(98)00104-5
  89. [89] A. M. Al-Saideen and S. Bataineh, A heuristic algorithm for scheduling multiclasses of tasks in multiprocessor systems, Int. J. Comput. Appl., 1999.
  90. [90] J. Sohn and T. G. Robertazzi, An optimal load sharing strategy for divisible jobs with time-varying processor speeds, IEEE Trans. Aerosp. Electron. Syst., vol. 34, no. 3, pp. 907-923, 1998. DOI:10.1109/7.705897
  91. [91] S. Bataineh and M. Al-Ibrahim, Load Management in Loosely Coupled Multiprocessor Systems. Dynamics and Control, Kluwer Academic Publishers, Boston, 1998. DOI:10.1023/a:1008283014820
  92. [92] Keqin Li, Managing Divisible Loads in Partitionable Networks, High Performance Computing Systems and Applications, pp. 217-228, 1998.
  93. [93] T. Hsu and D. R. Lopez, Executing Divisible Jobs on a Network with a Fixed Number of Processors, in Proc. COCOON, pp. 241-250, 1998. DOI:10.1007/3-540-68535-9_28
  94. [94] R. Y. Wang, A. Krishnamurthy, R. P. Martin, T. E. Anderson, and D. E. Culler, Modeling communication pipeline latency, ACM SIGMETRICS Perform. Eval. Rev., vol. 26, no. 1, pp. 22-32, 1998.
  95. [95] M. Drozdowski, Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems. Politechnika Poznanska, 1997. [link]
  96. [96] V. Bharadwaj, D. Ghose, V. Mani, and T. G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, 1996.
  97. [97] J. Blazewicz and M. Drozdowski, The Performance Limits of a Two-Dimensional Network of Load Sharing Processors, Found. Comput. Decis. Sci., vol. 21, no. 1, pp. 3-15, 1996. [link]
  98. [98] H. J. Kim, T. B. Jeon, and J. G. Lee, An Optimal Load Distribution Algorithm for Elliptic Solver, Advanced Computational and Design Techniques in Applied Electromagnetic Systems, S.-y. Hahn, editor, Elsevier Studies in Applied Electromagnetics in Materials, 6, pp. 215-218, 1995. DOI:10.1016/b978-0-444-82139-3.50062-8
  99. [99] D. Ghose and V. Mani, Distributed Computation with Communication Delays: Asymptotic Performance Analysis, J. Parallel Distrib. Comput., vol. 23, pp. 293-305, 1994. DOI:10.1006/jpdc.1994.1141
  100. [100] S. Bataineh and B. Asir, An Efficient Scheduling Algorithm for Divisible and Indivisible Tasks in Loosely Coupled Multiprocessor Systems, Software Engineering Journal (A joint publication of the IEE and the British Computer Society), 1994. DOI:10.1049/sej.1994.0003
  101. [101] S. Bataineh and T. G. Robertazzi, Ultimate performance limits for networks of load sharing processors, in Proc. Conf. Inf. Sci. Syst. (CISS), Princeton, NJ, USA, pp. 794-799, 1992. [link]
  102. [102] Y. C. Cheng and T. G. Robertazzi, Distributed computation with communication delays, IEEE Trans. Aerosp. Electron. Syst., vol. 24, no. 6, pp. 700-712, 1988. [link]
  103. [103] R. Agrawal and H. V. Jagadish, Partitioning Techniques for Large Grained Paralleism, IEEE Trans. Comput., vol. 37, no. 12, pp. 1627-1634, 1988. DOI:10.1109/12.9739
  104. [104] K. Li, Speedup of Parallel Processing of Divisible Loads on k-Dimensional Meshes and Tori, The Computer Journal., vol. 46, no. 6, pp. 625-631. DOI:10.1093/comjnl/46.6.625
  105. [105] S. Suresh, V. Mani, S. N. Omkar, and H. J. Kim, An Equivalent Network for Divisible Load Scheduling in Non-Blocking Mode of Communication, to appear in Comput. Math. Appl.. DOI:10.1016/j.camwa.2004.11.013

Topologies

  1. [106] C. Chen, Scheduling divisible loads on heterogeneous linear networks using pipelined communications, in Proc. IFSA-SCIS, pp. 1-6, 2017. DOI:10.1109/IFSA-SCIS.2017.8023321
  2. [107] S. Ghanbari, M. Othman, M. R. A. Bakar, and W. J. Leong, Multi-objective method for divisible load scheduling in multi-level tree network, Future Gener. Comput. Syst., vol. 54, pp. 132-143, 2016. DOI:10.1016/J.FUTURE.2015.03.015
  3. [108] C. Chen and C. Chu, A Novel Computational Model for Non-Linear Divisible Loads on a Linear Network, IEEE Trans. Computers, vol. 65, no. 1, pp. 53-65, 2016. DOI:10.1109/TC.2015.2419654
  4. [109] Z. Zhang and T. G. Robertazzi, Scheduling Divisible Loads in Gaussian, Mesh and Torus Network of Processors, IEEE Trans. Computers, vol. 64, no. 11, pp. 3249-3264, 2015. DOI:10.1109/TC.2015.2389843
  5. [110] X. Wang, Y. Wang, and K. Meng, Optimization Algorithm for Divisible Load Scheduling on Heterogeneous Star Networks, J. Softw., vol. 9, no. 7, pp. 1757-1766, 2014. DOI:10.4304/JSW.9.7.1757-1766
  6. [111] T. E. Carroll and D. Grosu, An incentive-based distributed mechanism for scheduling divisible loads in tree networks, J. Parallel Distrib. Comput., vol. 72, no. 3, pp. 389-401, 2012. DOI:10.1016/J.JPDC.2011.11.008
  7. [112] S. Sundaram, H. J. Kim, C. Run, and T. G. Robertazzi, Scheduling nonlinear divisible loads in a single level tree network, J. Supercomput, vol. 61, no. 3, pp. 1068-1088, 2012. DOI:10.1007/S11227-011-0677-2
  8. [113] A. Ilic and L. Sousa, Simultaneous Multi-Level Divisible Load Balancing for Heterogeneous Desktop Systems, in Proc. ISPA, pp. 683-690, 2012. DOI:10.1109/ISPA.2012.101
  9. [114] T. G. Robertazzi, A product form solution for tree networks with divisible loads, Parallel Process. Lett., vol. 21, no. 1, pp. 13-20, 2011. DOI:10.1142/s0129626411000035
  10. [115] K. Li, New Divisible Load Distribution Methods using Pipelined Communication Techniques on Tree and Pyramid Networks, IEEE Trans. Aerosp. Electron. Syst., vol. 47, no. 2, pp. 806-819, 2011. DOI:10.1109/TAES.2011.5751227
  11. [116] A. Shokripour, M. Othman, H. Ibrahim, and S. Subramaniam, A New Method for Job Scheduling in a Non-Dedicated Heterogeneous System, in Procedia Computer Science, Elsevier., pp. 271-275, 2011. DOI:10.1016/j.procs.2010.12.046
  12. [117] M. Hu and B. Veeravalli, Requirement-Aware Strategies with Arbitrary Processor Release Times for Scheduling Multiple Divisible Loads, IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 10, pp. 1697-1704, 2011. DOI:10.1109/TPDS.2011.31
  13. [118] A. Shokripour and M. Othman, Scheduling jobs in a heterogeneous system with unreliable network links by DLT, in International Conference on Communication Software and Networks (ICCSN), IEEE Computer Society, Singapore, pp. 68-72, 2010. DOI:10.1109/ICCSN.2010.114
  14. [119] X. Li and B. Veeravalli, PPDD: scheduling multi-site divisible loads in single-level tree networks, Cluster Comput., vol. 13, no. 1, pp. 31-46, 2010. DOI:10.1007/S10586-009-0103-1
  15. [120] J. Jia, B. Veeravalli, and J. B. Weissman, Scheduling Multisource Divisible Loads on Arbitrary Networks, IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 4, pp. 520-531, 2010. DOI:10.1109/TPDS.2009.62
  16. [121] H. Gonzalez-Velez and M. Cole, Adaptive Statistical Scheduling of Divisble Workloads in Heterogeneous Systems, Journal of Scheduling, 2009. DOI:10.1007/s10951-009-0138-4
  17. [122] S. Viswanathan, B. Veeravalli, and J. Jia, Spanning tree routing strategies for divisible load scheduling on arbitrary graphs - A comparative performance analysis, in Proc. HiPC, pp. 50-58, 2009. DOI:10.1109/HIPC.2009.5433225
  18. [123] S. Suresh, V. Mani, S. N. Omkar, H. J. Kim, and N. Sundararajan, A new load distribution strategy for linear network with communication delays, Math. Comput. Simul., vol. 79, no. 5, pp. 1488-1501, 2009.
  19. [124] M. Drozdowski and M. Lawenda, Scheduling multiple divisible loads in homogeneous star systems, J. Sched., vol. 11, no. 5, pp. 347-356, 2008. DOI:10.1007/s10951-007-0051-7
  20. [125] A. Ghatpande, H. Nakazato, O. Beaumont, and H. Watanabe, SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems, IEICE Transactions on Communications, E91- B( 8):, pp. 2571-2588, 2008. DOI:10.1093/ietcom/e91-b.8.2571
  21. [126] O. Beaumont, N. Bonichon, and L. Dubois, Scheduling Divisible Workloads on Heterogeneous Platforms under Bounded Multi-Port Model, in Heterogeneity in Computing Workshop in IEEE Symposium on Parallel and Distributed Processing, Miami FL, USA, 2008. DOI:10.1109/IPDPS.2008.4536170
  22. [127] A. Ghatpande, H. Nakazato, O. Beaumont, and H. Watanabe, Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems, IEICE Trans. Commun.-B, vol. 91, no. 7, pp. 2234-2243, 2008. DOI:10.1093/IETCOM/E91-B.7.2234
  23. [128] T. E. Carroll and D. Grosu, Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems, IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 8, pp. 1124-1135, 2008. DOI:10.1109/TPDS.2007.70818
  24. [129] B. Veeravalli and J. Jia, Design, Analysis, and Performance Evaluation of an Efficient Resource Unaware Scheduling Strategy for Processing Divisible Loads on Distributed Linear Daisy Chain Networks, in Proc. HiPC, pp. 390-401, 2008. DOI:10.1007/978-3-540-89894-8_35
  25. [130] A. Ghatpande, H. Nakazato, H. Watanabe, and O. Beaumont, Divisible Load Scheduling with Result Collection on Heterogeneous Systems, in Proc. IPDPS, pp. 1-8, 2008. DOI:10.1109/IPDPS.2008.4536162
  26. [131] S. Suresh, H. J. Kim, B. Y. Lee, and T. Robertazzi, An analytical solution for scheduling nonlinear divisible loads for a single level tree network with a collective communication model, IEEE Trans. Syst. Man Cybern., 2008.
  27. [132] D. England, B. Veeravalli, and J. Weissman, A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments, IEEE Transcations on Parallel and Distributed Systems, vol. 18, no. 5, pp. 608-620, 2007. DOI:10.1109/TPDS.2007.1032
  28. [133] J. Jia, V. Bharadwaj, and D. Ghose, Adaptive Load Distribution Strategies for Divisible Load Processing on Resource Unaware Multilevel Tree Networks, IEEE Trans. Comput., vol. 56, no. 7, pp. 999-1005, 2007. DOI:10.1109/TC.2007.1068
  29. [134] T. E. Carroll and D. Grosu, A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks, in Proc. IPDPS, pp. 1-9, 2007. DOI:10.1109/IPDPS.2007.370228
  30. [135] Xinxin Liu, Han Zhao, and Xiaolin Li, Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks, in Proc. PDPTA, pp. 528-534, 2007.
  31. [136] M. Moges and T. G. Robertazzi, Divisible load scheduling and Markov chain models, Comput. Math. Appl., vol. 52, pp. 1529-1542, 2006. DOI:10.1016/j.camwa.2006.05.016
  32. [137] L. Marchal, Y. Yang, H. Casanova, and Y. Robert, Steady-State Scheduling of Multiple Divisible Load Applications on Wide-Area Distributed Computing Platforms, Int. J. High Perform. Comput. Appl., vol. 20, no. 3, pp. 365-381, 2006. DOI:10.1177/1094342006067474
  33. [138] J. Jia and B. Veeravalli, Resource Unaware Computing - A Distributed Strategy for Divisible Load Processing on Linear Daisy Chain Networks, in Proc. ICON, pp. 1-6, 2006. DOI:10.1109/ICON.2006.302689
  34. [139] T. E. Carroll and D. Grosu, A strategy proof mechanism for scheduling divisible loads in bus networks without control processors, in Proc. IPDPS, 2006. DOI:10.1109/IPDPS.2006.1639263
  35. [140] H. Taoliu, J. Yang, Z. Huang, Y. Bai, and Y. Qiu, MDLP - The Resource Allocating Policy for Multi Divisible Loads in Heterogeneous Linear Networks, in Proc. SKG, pp. 61, 2006. DOI:10.1109/SKG.2006.62
  36. [141] O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems, IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 3, pp. 207-218, 2005. DOI:10.1109/TPDS.2005.35
  37. [142] H. M. Wong, V. Bharadwaj, and B. Gerassimos, Design and Performance Evaluation of Load Distribution Strategies for Multiple Divisible Loads on Heterogeneous Linear Daisy Chain Networks, J. Parallel Distrib. Comput., vol. 65, pp. 1558-1577, 2005. DOI:10.1016/j.jpdc.2005.05.016
  38. [143] L. Marchal, Y. Yang, H. Casanova, and Y. Robert, A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms, in International Parallel and Distributed Processing Symposium (IPDPS), 2005. DOI:10.1109/IPDPS.2005.63
  39. [144] O. Beaumont, L. Marchal, and Y. Robert, Scheduling Divisible Loads with Return Messages on Heterogeneous Master-Worker Platforms, in Proc. HiPC, pp. 498-507, 2005. DOI:10.1007/11602569_51
  40. [145] J. T. Hung and T. G. Robertazzi, Divisible load cut through switching in sequential tree networks, IEEE Trans. Aerosp. Electron. Syst., vol. 40, no. 3, pp. 968-982, 2004. DOI:10.1109/TAES.2004.1337468
  41. [146] B. Veeravalli and H. M. Wong, Scheduling Divisible Loads on Heterogeneous Linear Daisy Chain Networks with Arbitrary Processor Release Times, IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 3, pp. 273-288, 2004. DOI:10.1109/TPDS.2004.1264811
  42. [147] C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms, IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 4, pp. 1, 2004. DOI:10.1109/TPDS.2004.1271181
  43. [148] G. Barlas and B. Veeravalli, Quantized Load Distribution for Tree and Bus-connected Processors, Parallel Comput., vol. 30, no. 7, pp. 841-865, 2004. DOI:10.1016/j.parco.2004.06.002
  44. [149] Z. Zeng and B. Veeravalli, Divisible Load Scheduling on Arbitrary Distributed Networks via Virtual Routing Approach, in Proc. ICPADS, pp. 161, 2004. DOI:10.1109/ICPADS.2004.35
  45. [150] K. Li, Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications, in Proc. IPDPS, 2004. DOI:10.1109/IPDPS.2004.1303270
  46. [151] S. Suresh, V. Mani, and S. N. Omkar, The Effect of Start-up in Scheduling Divisible Loads on Bus Networks: An Alternate Approach, Computers and Matehmatics with Applications, vol. 46, no. 10, pp. 1545-1557, 2003. DOI:10.1016/s0898-1221(03)90190-8
  47. [152] P. Dutot, Divisible Load on Heterogeneous Linear Array, in Proc. International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France., 2003.
  48. [153] O. Beaumont, A. Legrand, and Y. Robert, Scheduling divisible workloads on heterogeneous platforms, Parallel Comput., vol. 29, no. 9, pp. 1121-1152, 2003. DOI:10.1016/S0167-8191(03)00095-4
  49. [154] V. Bharadwaj and G. D. Barlas, Efficient Strategies for Processing Multiple Divisible Loads on Bus Networks, Journal of Parallel and Distributed Computation, no. 62, pp. 132-151, 2002. DOI:10.1006/jpdc.2001.1778
  50. [155] O. Beaumont, L. Carter, J. Ferrante, and Y. Robert, Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms, in Proc. International Parallel and Distributed Processing Symposium (IPDPS'02), 2002. DOI:10.1109/IPDPS.2002.1015568
  51. [156] H. M. Wong, B. Veeravalli, and G. D. Barlas, Scheduling Multiple Divisible Loads on Heterogeneous Linear Daisy Chain Networks, in Proc. 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), Cambridge, MA, USA, pp. 345-350, 2002.
  52. [157] K. Li, Scheduling Divisible Tasks on Heterogeneous Linear Arrays with Applications to Layered Networks, in Proc. IPDPS, 2002. DOI:10.1109/IPDPS.2002.1016659
  53. [158] V. Bharadwaj and N. Viswanadham, Sub-Optimal Solutions Using Integer Approximation Techniques for Scheduling Divisible Loads on Distributed Bus Networks, IEEE Trans. Syst., Man, Cybern.: Part A, vol. 30, no. 6, pp. 680-691, 2000. DOI:10.1109/3468.895891
  54. [159] M. Drozdowski and W. Głazek, Scheduling divisible loads in a three-dimensional mesh of processors, Parallel Comput., vol. 25, no. 4, pp. 381-404, 1999. DOI:10.1016/s0167-8191(99)00004-6
  55. [160] J. Blazewicz, M. Drozdowski, F. Guinand, and D. Trystram, Scheduling a Divisible Task in a 2-Dimensional Mesh, Discrete Applied Mathematics, pp. 35, 1999. DOI:10.1016/s0166-218x(99)00013-x
  56. [161] W. Glazek, How To Share a Divisible Load in a Hypercube, in Proc. ACPC, pp. 588-589, 1999. DOI:10.1007/3-540-49164-3_63
  57. [162] G. D. Barlas, Collection Aware Optimum Sequencing of Operations and Closed Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees, IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 5, pp. 429-441, 1998. DOI:10.1109/71.679214
  58. [163] W. Glazek, A Greedy Algorithm for Processing a Divisible Load on a Hypercube, in Proc. International Conference on Parallel Computing in Electrical Engineering (PARELEC'98), Bialystok, Poland, pp. 185-188, 1998.
  59. [164] W. Glazek, Scheduling Divisible Loads on a Chain of Processors, in Proc. International Conference on Principles of Distributed Systems (OPODIS '97), Editions Hermes, Paris., pp. 123-136, 1997.
  60. [165] J. Sohn and T. G. Robertazzi, Optimal load sharing for a divisible job on a bus network, IEEE Trans. Aerosp. Electron. Syst., vol. 32, no. 1, pp. 34-40, 1996. DOI:10.1109/7.481247
  61. [166] H. J. Kim, G. Jee, and J. G. Lee, Optimal Load Distribution for Tree Network Processors, IEEE Trans. Aerosp. Electron. Syst., vol. 32, no. 2, pp. 607-612, 1996. DOI:10.1109/7.489505
  62. [167] V. Bharadwaj, H. F. Li, and T. Radhakrishnan, Scheduling Divisible Loads in Bus Networks with Arbitrary Processor Release Times. Comput. Math. Appl., Pergamon Press, 1996. DOI:10.1016/0898-1221(96)00156-3
  63. [168] J. Błażewicz and M. Drozdowski, Scheduling divisible jobs on hypercubes, Parallel Comput., vol. 21, pp. 1945-1956, 1995. DOI:10.1016/0167-8191(95)00046-1
  64. [169] V. Bharadwaj, D. Ghose, and V. Mani, An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays, Computer and Mathematics with Applications, vol. 29, no. 9, pp. 95-112, 1995. DOI:10.1016/0898-1221(95)00039-2
  65. [170] S. Bataineh, T. Hsiung, and T. G. Robertazzi, Closed form solutions for bus and tree networks of processors load sharing a divisible job, IEEE Trans. Comput., vol. 43, no. 10, pp. 1184-1196, 1994. DOI:10.1109/ICPP.1993.54
  66. [171] J. Sohn and T. G. Robertazzi, A multi-job load sharing strategy for divisible jobs on bus networks, in Proc. Conf. Inf. Sci. Syst. (CISS), Princeton, NJ, USA, 1994. [link]
  67. [172] V. Mani and D. Ghose, Distributed Computation in a Linear Network: Closed-Form Solutions and Computational Techniques, IEEE Transactions on Aerospace & Electronic Systems, vol. 30, no. 2, 1994. DOI:10.1109/7.272269
  68. [173] V. Bharadwaj, D. Ghose, and V. Mani, Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays, IEEE Trans. Parallel Distrib. Syst., pp., vol. 5, no. 9, pp. 968-976, 1994. DOI:10.1109/71.308534
  69. [174] S. Bataineh and M. Al-Ibrahim, Effect of Fault Tolerance and Communication Delay on Response Time in Multiprocessor System with Bus Topology, Computer Communications, vol. 17, no. 12, pp. 843-851, 1994. DOI:10.1016/0140-3664(94)90027-2
  70. [175] S. M. Bataineh, T. Hsiung, and T. G. Robertazzi, Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job, IEEE Trans. Computers, vol. 43, no. 10, pp. 1184-1196, 1994. DOI:10.1109/12.324544
  71. [176] T. G. Robertazzi, Processor equivalence for a linear daisy chain of load sharing processors, IEEE Trans. Aerosp. Electron. Syst., vol. 29, no. 4, pp. 1216-1221, 1993. DOI:10.1007/springerreference_11546
  72. [177] Y. C. Cheng and T. G. Robertazzi, Distributed computation for a tree network with communication delays, IEEE Trans. Aerosp. Electron. Syst., vol. 26, no. 3, pp. 511-516, 1990. DOI:10.1109/7.106129
  73. [178] S. Suresh, V. Mani, S. N. Omkar, and H. J. Kim, A New Load Distribution Strategy for Linear Network of Communicating Processors, Math. Comput. Simul.. DOI:10.1016/j.matcom.2008.06.003
  74. [179] E. Haddad, Optimal Load Sharing in Dynamically Heterogeneous Systems, in Proc. Seventh Annual IEEE Symposium on Parallel and Distributed Processing, San Antonio TX, Oct. 95. DOI:10.1109/SPDP.1995.530704

Multi-installment & memory

  1. [180] G. M. Chinnappan, B. Veeravalli, K. Mouthaan, and J. W. Lee, Experimental evaluation of a multi-installment scheduling strategy based on divisible load paradigm for SAR image reconstruction on a distributed computing infrastructure, J. Parallel Distrib. Comput., vol. 193, pp. 104942, 2024. DOI:10.1016/J.JPDC.2024.104942
  2. [181] K. Wu, Y. Li, X. Song, and X. Wang, Multi-installment scheduling for coarse-grained divisible loads, in Proc. CIS, pp. 452-455, 2022. DOI:10.1109/CIS58238.2022.00102
  3. [182] X. Wang, B. Veeravalli, and J. Song, Multi-Installment Scheduling for Large-Scale Workload Computation with Result Retrieval, Neurocomputing, vol. 458, pp. 626-638, 2021. DOI:10.1016/j.neucom.2020.03.124
  4. [183] M. Drozdowski, G. Singh, and J. M. Marszałkowski, Isoefficiency maps for divisible computations in hierarchical memory systems, in Parallel Processing and Applied Mathematics (PPAM), ser. LNCS 1. Springer., pp. 224-234, 2020. DOI:10.1007/978-3-030-43229-4_20
  5. [184] X. Wang and B. Veeravalli, Performance Characterization on Handling Large-Scale Partitionable Workloads on Heterogeneous Networked Compute Platforms, IEEE Trans. Parallel Distrib. Syst., vol. 28, no. 10, pp. 2925-2938, 2017. DOI:10.1109/TPDS.2017.2693149
  6. [185] X. Wang, Y. Wang, Z. Wei, and J. Wei, New model and genetic algorithm for multi-installment divisible-load scheduling, in Proc. CEC, pp. 2775-2780, 2015. DOI:10.1109/CEC.2015.7257233
  7. [186] X. Wang, Y. Wang, Z. Wei, and Y. Song, A New Method for Multi-installment Divisible-Load Scheduling, in Proc. SMC, pp. 2708-2713, 2015. DOI:10.1109/SMC.2015.473
  8. [187] A. Shokripour, M. Othman, H. Ibrahim, and S. Subramaniam, A New Method for Job Scheduling in Two-Levels Hierarchical Systems, Selemat, A., Nguyen, T. and Haron, H., (editors) Intelligent Information and Database Systems, Lecture Notes in Computer Science., vol. 7803, pp. 345-355, 2013. DOI:10.1007/978-3-642-36543-0_36
  9. [188] A. Shokripour, M. Othman, H. Ibrahim, and S. Subramaniam, New method for scheduling heterogeneous multi-installment systems, Future Gener. Comput. Syst., vol 28, no. 8, pp. 1205-1216, 2012. DOI:10.1016/j.future.2012.03.008
  10. [189] A. Shokripour, M. Othman, H. Ibrahim, and S. Subramaniam, A New Method for Scheduling Divisible Data on a Heterogeneous Two-Levels Hierarchical System, in Procedia Computer Science., pp. 2196-2205, 2011. DOI:10.1016/j.procs.2011.04.240
  11. [190] A. Shokripour, M. Othman, H. Ibrahim, and S. Subramaniam, A Method for Scheduling Heterogeneous Multi-Installment Systems. Lecture Notes in Artificial Intelligence, Springer Berlin/Heidelberg, 2011. DOI:10.1007/978-3-642-20042-7_4
  12. [191] A. Ilic and L. Sousa, Scheduling Divisible Loads on Heterogeneous Desktop Systems with Limited Memory, in Proc. Euro-Par Workshops, pp. 491-501, 2011. DOI:10.1007/978-3-642-29737-3_54
  13. [192] J. Berlinska and M. Drozdowski, Heuristics for Multi-Round Divisible Loads Scheduling with Limited Memory, Parallel Comput., vol. 26, pp. 199-211, 2010. DOI:10.1016/j.parco.2010.02.004
  14. [193] A. Shokripour, M. Othman, and H. Ibrahim, A Method for Scheduling Last Installment in a Heterogeneous Multi-Installment System, in IEEE International Conference on Computer Science and Information Technology (IEEE ICCSIT), IEEE Computer Society, Chengdu, China, pp. 714-718, 2010. DOI:10.1109/ICCSIT.2010.5565003
  15. [194] J. Berlinska, M. Drozdowski, and M. Lawenda, Experimental Study of Scheduling with Memory Constraints using Hybrid Methods, Journal of Computational and Applied Mathematics, vol. 232, pp. 638-654, 2009. DOI:10.1016/j.cam.2009.07.004
  16. [195] L. Xia, Z. Cheng, and Q. Zeng-Yan, Multi-round scheduling for divisible loads on the heterogeneous cluster systems of multi-core computers, in Proc. ICIS, pp. 846-852, 2009. DOI:10.1145/1655925.1656079
  17. [196] Yongcai Tao, Hai Jin, Song Wu, and Xuanhua Shi, Adaptive multi-round scheduling strategy for divisible workloads in grid environments, in Proc. 23rd International Conference on Information Networking (ICOIN), pp. 1-5, 2009. DOI:10.1109/ICOIN.2009.4897300
  18. [197] Z. Dai, F. Viale, X. Chi, D. Caromel, and Z. Lu, A Task-Based Fault-Tolerance Mechanism to Hierarchical Master/Worker with Divisible Tasks, in Proc. HPCC, pp. 672-677, 2009. DOI:10.1109/HPCC.2009.35
  19. [198] J. Berlińska, M. Drozdowski, and M. Lawenda, Multi-installment divisible loads scheduling in systems with limited memory, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Res. Rep. RA-07/08, 2008. [link]
  20. [199] X. Lin, J. S. Deogun, Y. Lu, and S. Goddard, Multi-round Real-Time Divisible Load Scheduling for Clusters, in Proc. HiPC, pp. 196-207, 2008. DOI:10.1007/978-3-540-89894-8_20
  21. [200] Y. Yang, H. Casanova, M. Drozdowski, M. Lawenda, and A. Legrand, On the complexity of multi-round divisible load scheduling, INRIA Rhône-Alpes, Montbonnot, France, Res. Re, pp. 6096, 2007. [link]
  22. [201] Y. Chang, J. Wu, C. Chen, and C. P. Chu, Improved Methods for Divisible Load Distribution on k-Dimensional Meshes using Multi-Installment, IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 11, 2007. DOI:10.1109/TPDS.2007.1103
  23. [202] M. Drozdowski and M. Lawenda, Multi-installment divisible load processing in heterogeneous distributed systems, Concurr. Comput. Pract. Exp., vol. 19, no. 17, pp. 2237-2253, 2007. DOI:10.1002/CPE.1180
  24. [203] M. Drozdowski and M. Lawenda, A New Model of Multi-installment Divisible Loads Processing in Systems with Limited Memory, in Proc. PPAM, pp. 1009-1018, 2007. DOI:10.1007/978-3-540-68111-3_107
  25. [204] M. Drozdowski and M. Lawenda, Multi-installment divisible load processing in heterogeneous systems with limited memory, in Parallel Processing and Applied Mathematics (PPAM), ser. LNCS 3911. Springer., pp. 847-854, 2006. DOI:10.1007/11752578_102
  26. [205] M. Drozdowski and P. Wolniewicz, Optimum Divisible Load Scheduling on Heterogeneous Stars with Limited Memory, European Journal of Operational Research, issue 2, vol. 172, pp. 545-559, 2006. DOI:10.1016/j.ejor.2004.10.022
  27. [206] H. Yamamoto and M. Tsuru, A Parallel Transferable Uniform Multi-Round Algorithm in Heterogeneous Distributed Computing Environment. Lecture Notes in Computer Science 4208, Springer, 2006. DOI:10.1007/11847366_6
  28. [207] S. Sundaram, V. Mani, S. N. Omkar, and H. J. Kim, Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach, Int. J. Parallel Emergent Distributed Syst., vol. 21, no. 5, pp. 303-321, 2006. DOI:10.1080/17445760600567842
  29. [208] M. Drozdowski and M. Lawenda, On Optimum Multi-installment Divisible Load Processing, in J.C. Cunha, P.D. Medeiros (eds.) Euro-Par Parallel Processing, Lecture Notes in Computer Science 3648, Springer, 231-240, 2005. DOI:10.1007/11549468_28
  30. [209] H. Yamamoto and M. Tsuru, Parallel Transferable Uniform Multi-Round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload. Lecture Notes in Computer Science 3726, Springer, 2005. DOI:10.1007/11557654_92
  31. [210] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory, in Proc. PDP, pp. 179-186, 2005. DOI:10.1109/EMPDP.2005.25
  32. [211] S. Mingsheng and S. Shixin, Optimal multi-installments algorithm for divisible load scheduling, in Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPC Asia), pp. 45-54, 2005.
  33. [212] M. Drozdowski and P. Wolniewicz, Performance limits of divisible load processing in systems with limited communication buffers, J. Parallel Distrib. Comput., vol. 64, no. 8, pp. 960-973, 2004. DOI:10.1016/j.jpdc.2004.04.003
  34. [213] J. Yao, Divisible Load Scheduling Strategies on Distributed Multi-level Tree Networks with Communication Delays and Buffer Constraints, Computer Communications, issue 1, vol. 27, pp. 93-110, 2004. DOI:10.1016/s0140-3664(03)00181-6
  35. [214] The Problem with AI / Defining Memory / Divisible Load-Scheduling Discovery, Computer, vol. 37, no. 1, pp. 6-7, 2004. DOI:10.1109/MC.2004.10000
  36. [215] M. Drozdowski and P. Wolniewicz, Out-of-core divisible load processing, IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 10, pp. 1048-1056, 2003. DOI:10.1109/TPDS.2003.1239872
  37. [216] M. Drozdowski and P. Wolniewicz, Divisible load scheduling in systems with limited memory, Cluster Comput., vol. 6, pp. 19-29, 2003. DOI:10.1023/a:1020910932147
  38. [217] B. Veeravalli and G. D. Barlas, Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks, Cluster Comput., vol. 6, no. 1, pp. 63-74, 2003. DOI:10.1023/A:1020971118034
  39. [218] H. Casanova, UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads, in Proc. International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France., 2003. DOI:10.1109/IPDPS.2003.1213101
  40. [219] B. Xiaolin and C. C. Ko, Divisible Load Scheduling on a Hypercube Cluster with Finite-size Buffers and Granularity Constraints, in In the in Proc. IEEE/ACM International Symposium on Cluster Comput. and the Grid ( CCGrid), May, Brisbane, Australia, 2001. DOI:10.1109/CCGRID.2001.923257
  41. [220] P. Wolniewicz and M. Drozdowski, Processing Time and Memory Requirements for Multi-instalment Divisible Job Processing, in Proc. PPAM, pp. 125-136, 2001. DOI:10.1007/3-540-48086-2_14
  42. [221] X. Li, V. Bharadwaj, and C. C. Ko, Optimal Divisible Task Scheduling on Single-Level Tree Networks with Finite Size Buffers, Accepted for publication in IEEE Trans. Aerosp. Electron. Syst., 2000. DOI:10.1109/7.892677
  43. [222] G. Barlas and V. Bharadwaj, Theoretical and Practical aspects of multi-installment distribution for the processing of multiple divisible loads on bus networks, in Proc. ICCI, 2000.
  44. [223] V. Bharadwaj, D. Ghose, and V. Mani, Multi-installment Load Distribution in Tree Networks with Delays, IEEE Transactions on Aerospace & Electronic Systems, vol. 31, no. 2, pp. 555-567, 1995. DOI:10.1109/7.381944

Energy & cost

  1. [224] Y. Zhang, M. Li, and F. Tong, Energy-efficient load balancing for divisible tasks on heterogeneous clusters, Trans. Emerg. Telecommun. Technol., vol. 34, no. 10, 2023. DOI:10.1002/ETT.4829
  2. [225] M. Drozdowski and N. V. Shakhlevich, Scheduling divisible loads with time and cost constraints, J. Sched., vol. 24, no. 5, pp. 507-521, 2021. DOI:10.1007/s10951-019-00626-6
  3. [226] J. Marszałkowski, M. Drozdowski, and G. Singh, Time-energy trade-offs in processing divisible loads on heterogeneous hierarchical memory systems, J. Parallel Distrib. Comput., vol. 144, pp. 206-219, 2020. DOI:10.1016/j.jpdc.2020.05.015
  4. [227] X. Wang, B. Veeravalli, and H. Ma, On the Design of a Time, Resource and Energy Efficient Multi-Installment Large-Scale Workload Scheduling Strategy for Network-Based Compute Platforms, IEEE Trans. Parallel Distrib. Syst., vol. 30, no. 5, pp. 1120-1133, 2019. DOI:10.1109/TPDS.2018.2877668
  5. [228] L. Ismail and A. A. Fardoun, Towards energy-aware task scheduling (EATS) framework for divisible-load applications in cloud computing infrastructure, in Proc. SysCon, pp. 1-6, 2017. DOI:10.1109/SYSCON.2017.7934791
  6. [229] J. M. Marszałkowski and M. Drozdowski, Divisible loads scheduling in hierarchical memory systems with time and energy constraints, in Parallel Processing and Applied Mathematics (PPAM), Part II, ser. LNCS 9574. Springer., pp. 111-120, 2016. DOI:10.1007/978-3-319-32152-3_11
  7. [230] D. Liu, X. Yang, and Z. Cheng, An energy-aware scheduling algorithm for divisible loads in a bus network, Concurr. Comput. Pract. Exp., vol. 28, no. 5, pp. 1612-1628, 2016. DOI:10.1002/CPE.3713
  8. [231] C. Scholl, K. Kobert, T. Flouri, and A. Stamatakis, The Divisible Load Balance Problem with Shared Cost and Its Application to Phylogenetic Inference, in Proc. IPDPS Workshops, pp. 408-417, 2016. DOI:10.1109/IPDPSW.2016.38
  9. [232] C. Chen and C. Chu, Novel Methods for Divisible Load Distribution with Start-Up Costs on a Complete b-Ary Tree, IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 10, pp. 2836-2848, 2015. DOI:10.1109/TPDS.2014.2362137
  10. [233] H. Xuan, Y. Wang, S. Hao, and X. Wang, Cost-Efficient Divisible Load Scheduling Using Genetic Algorithm, in Proc. CIS, pp. 14-17, 2015. DOI:10.1109/CIS.2015.12
  11. [234] P. Agrawal and S. Rao, Energy-Minimal Scheduling of Divisible Loads, in Proc. e-Energy., pp. 265-270, 2015. DOI:10.1145/2768510.2768528
  12. [235] M. Drozdowksi, J. M. Marszalkowski, and J. Marszalkowski, Energy Trade-Offs Analysis using Equal-Energy Maps, Future Gener. Comput. Syst., Elsevier., 2013. DOI:10.1016/j.future.2013.07.004
  13. [236] N. V. Shakhlevich, Scheduling Divisible Loads to Optimize the Computation Time and Cost, Altmann, J., Vanmechelen, K., and Rana, O.F. (editors), GECON, Lecture Notes in Computer Science 8193, pp. 138-148, 2013. DOI:10.1007/978-3-319-02414-1_10
  14. [237] M. Abdullah and M. Othman, Cost-based Multi-QoS Job Scheduling using Divisible Load Theory in Cloud Computing, in International Conference on Computational Science, 2013. DOI:10.1016/j.procs.2013.05.258
  15. [238] G. Aupy, A. Benoit, R. G. Melhem, P. Renaud-Goud, and Y. Robert, Energy-aware checkpointing of divisible tasks with soft or hard deadlines, in Proc. IGCC, pp. 1-8, 2013. DOI:10.1109/IGCC.2013.6604467
  16. [239] H. Shi, W. Wang, and N. Kwok, Energy Dependent Divisible Load Theory for Wireless Sensor Network Workload Allocation, Mathematical Problems in Engineering, Hindawi, 2012. DOI:10.1155/2012/235289
  17. [240] S. Chuprat and S. K. Baruah, Real-Time Divisible Load Theory: Incorporating Computation Costs, in Proc. RTCSA, pp. 33-37, 2011. DOI:10.1109/RTCSA.2011.11
  18. [241] M. Drozdowski, Energy considerations for divisible load processing, in Parallel Processing and Applied Mathematics (PPAM), ser. LNCS 6068. Springer., pp. 92-101, 2010. DOI:10.1007/978-3-642-14403-5_11
  19. [242] W. Depoorter, R. V. d. Bossche, K. Vanmechelen, and J. Broeckhove, Evaluating the Divisible Load Assumption in the Context of Economic Grid Scheduling with Deadline-Based QoS guarantees, in Proc. CCGRID, pp. 452-459, 2009. DOI:10.1109/CCGRID.2009.36
  20. [243] K. Choi and T. G. Robertazzi, Divisible Load Scheduling inWireless Sensor Networks with Information Utility, in Proc. IPCCC, pp. 9-17, 2008. DOI:10.1109/PCCC.2008.4745126
  21. [244] J. Hu and R. Klefstad, Scheduling Divisible Loads on Bus Networks with Start-Up Costs by Utilizing Multiple Data Transfer Streams: PORI, in Proc. ICPP, pp. 23, 2007. DOI:10.1109/ICPP.2007.75
  22. [245] J. Hu and R. Klefstad, Scheduling Divisible Loads on Bus Networks with Arbitrary Processor Release Time and Start-Up Costs: XRMI, in Proc. IPCCC, pp. 356-364, 2007. DOI:10.1109/PCCC.2007.358914
  23. [246] S. Charcranoon, T. G. Robertazzi, and S. Luryi, Load sequencing for a parallel processing utility, J. Parallel Distrib. Comput., vol. 64, pp. 29-35, 2004. DOI:10.1016/s0743-7315(03)00113-8
  24. [247] M. A. Moges, L. A. Ramirez, C. Gamboa, and T. G. Robertazzi, Monetary Cost and Energy Use Optimization in Divisible Load Processing, in Conference on Information Sciences and Systems (CISS), Princeton University, Princeton, NJ, USA, 2004. [link]
  25. [248] S. Charcranoon, T. G. Robertazzi, and S. Luryi, Parallel processor configuration design with processing/transmission costs, IEEE Trans. Comput., Se., vol. 49, no. 9, pp. 987-991, 2000. DOI:10.1109/12.869332
  26. [249] V. Bharadwaj, Xiaolin Li, and, and C. C. Ko, On the Influence of Start-up Costs in Scheduling Divisible Loads on Bus Networks, IEEE Trans. Parallel Distrib. Syst., vol. 11, no. 12, pp. 1288-1305, 2000. DOI:10.1109/71.895794
  27. [250] V. Bharadwaj, X. Li, and C. C. Ko, Design and Analysis of Load Distribution Strategies with Start-up Costs in Scheduling Divisible Loads on Distributed Networks. Accepted for publication in Mathematical and Computer Modelling, Pergamon Press, April, 1999. DOI:10.1016/s0895-7177(00)00179-5
  28. [251] J. Sohn, T. G. Robertazzi, and S. Luryi, Optimizing computing costs using divisible load analysis, IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 3, pp. 225-234, 1998. DOI:10.1109/71.674315
  29. [252] J. Błażewicz and M. Drozdowski, Distributed processing of divisible jobs with communication startup costs, Discrete Appl. Math.-3, vol. 76, no. 1, pp. 21-41, 1997. DOI:10.1016/s0166-218x(96)00115-1

Applications

  1. [253] B. Veeravalli, Resource-Aware Task Allocator Design: Insights and Recommendations for Distributed Satellite Constellations, arXiv:2601.06706, 2026. [link]
  2. [254] X. Wang, B. Veeravalli, X. Song, and K. Zhang, Maximizing Heterogeneous Server Utilization with Limited Availability Times for Divisible Loads Scheduling on Networked Systems, Sensors, vol. 23, no. 7, pp. 3550, 2023. DOI:10.3390/S23073550
  3. [255] G. M. Chinnappan and B. Veeravalli, Theoretical Analysis of an Adaptive Periodic Multi Installment Scheduling With Result Retrieval for {SAR, IEEE Trans. Parallel Distrib. Syst., vol. 33, no. 12, pp. 4672-4683, 2022. DOI:10.1109/TPDS.2022.3194542
  4. [256] S. N. Aali and N. Bagherzadeh, Divisible load scheduling of image processing applications on the heterogeneous star and tree networks using a new genetic algorithm, Concurr. Comput. Pract. Exp., vol. 32, no. 10, 2020. DOI:10.1002/CPE.5498
  5. [257] M. L. A. Majid and S. Chuprat, Adapting Market-Oriented Policies for Scheduling Divisible Loads on Clouds, Int. J. Distributed Syst. Technol., vol. 11, no. 2, pp. 45-55, 2020. DOI:10.4018/IJDST.2020040104
  6. [258] G. M. Chinnappan and B. Veeravalli, Handling Large-Scale SAR Image Data on Network-based Compute systems using Divisible load paradigm, in Proc. HPCC/DSS/SmartCity, pp. 231-238, 2020. DOI:10.1109/HPCC-SMARTCITY-DSS50907.2020.00029
  7. [259] S. Kang, B. Veeravalli, and K. M. M. Aung, Dynamic scheduling strategy with efficient node availability prediction for handling divisible loads in multi-cloud systems, J. Parallel Distrib. Comput., vol. 113, pp. 1-16, 2018. DOI:10.1016/J.JPDC.2017.10.006
  8. [260] S. N. Aali, H. S. Shahhoseini, and N. Bagherzadeh, Divisible Load Scheduling of Image Processing Applications on the Heterogeneous Star Network Using a new Genetic Algorithm, in Proc. PDP, pp. 77-84, 2018. DOI:10.1109/PDP2018.2018.00019
  9. [261] G. D. Barlas and L. E. Hiny, Closed-Form Solutions for Dense Matrix-Matrix Multiplication on Heterogeneous Platforms Using Divisible Load Analysis, in Proc. PDP, pp. 376-384, 2018. DOI:10.1109/PDP2018.2018.00067
  10. [262] X. Wang, B. Veeravalli, and O. F. Rana, An Optimal Task-Scheduling Strategy for Large-Scale Astronomical Workloads using In-transit Computation Model, Int. J. Comput. Intell. Syst., vol. 11, no. 1, pp. 600-607, 2018. DOI:10.2991/ijcis.11.1.46
  11. [263] L. Ismail and L. Khan, Implementation and performance evaluation of a scheduling algorithm for divisible load parallel applications in a cloud computing environment, Softw. Pract. Exp., vol. 45, no. 6, pp. 765-781, 2015. DOI:10.1002/SPE.2258
  12. [264] S. Sundaram, H. Huang, and H. J. Kim, Scheduling in compute cloud with multiple data banks using divisible load paradigm, IEEE Trans. Aerosp. Electron. Syst., vol. 51, no. 2, pp. 1288-1297, 2015. DOI:10.1109/TAES.2014.130201
  13. [265] J. Chen, Q. Zheng, H. Long, and W. Wang, Divisible Load Scheduling in Mobile Grid Based on Stackelberg Pricing Game, in Proc. VTC Spring., pp. 1-5, 2015. DOI:10.1109/VTCSPRING.2015.7145787
  14. [266] Z. Ying and T. G. Robertazzi, Signature searching in a networked collection of files, IEEE Trans. Parallel Distrib. Syst., vol. 29, no. 5, pp. 1339-1348, 2014. DOI:10.1109/TPDS.2013.258
  15. [267] G. Murugesan and C. Chellappan, Multi-Source Task Scheduling in Grid Computing Environment using Linear Programming, International Journal of Computer Science and Engineering, Inderscience Publishers, vol. 9, no. 1, pp. 80-85, 2014. DOI:10.1504/ijcse.2014.058701
  16. [268] W. Lin, C. Liang, J. Z. Wang, and R. Buyya, Bandwidth-Aware Divisible Task Scheduling for Cloud Computing, Software: Practice and Experience, Wiley, vol. 44, no. 2, pp. 163-174, 2014. DOI:10.1002/spe.2163
  17. [269] H. Shi, N. M. Kwok, W. Wang, and S. Chen, Divisible Load Theory Based Active-Sleep Workload Assignment Schemes for Wireless Sensor Networks, Int. J. Distributed Sens. Networks., vol. 10, 2014. DOI:10.1155/2014/929416
  18. [270] S. Kang, B. Veeravalli, and K. M. M. Aung, Scheduling Multiple Divisible Loads in a Multi-cloud System, in Proc. UCC, pp. 371-378, 2014. DOI:10.1109/UCC.2014.47
  19. [271] M. Hu and B. Veeravalli, Dynamic Scheduling of Hybrid Real-Time Tasks on Clusters, IEEE Trans. Comput., 2013. DOI:10.1109/TC.2013.170
  20. [272] M. Hu and B. Veeravalli, Requirement-Aware Strategies for Scheduling Real-Time Divisible Loads on Clusters, J. Parallel Distrib. Comput., vol. 73, no. 8, pp. 1083-1091, 2013. DOI:10.1016/j.jpdc.2013.03.013
  21. [273] H. Shi, W. Wang, N. Kwok, and S. Chen, Adaptive Indexed Divisible Load Theory for Wireless Sensor Network Workload Allocation, International Journal of Distributed Sensor Networks, Hindawi Publishing Corp, 2013. DOI:10.1155/2013/484796
  22. [274] C. Rosas, A. Sikora, J. Jorba, A. Moreno, and E. Cesar, Improving Performance on Data-Intensive Applications using a Load Balancing Methodology based on Divisible Load Theory, International Journal of Parallel Programming, vol. 42, pp. 94-118, 2013. DOI:10.1007/s10766-012-0199-4
  23. [275] J. Berlinska and M. Drozdowski, Mitigating Partitioning Skew in MapReduce Computations, in Proc. 6th Multidisciplinary International Scheduling Conference: Theory & Applications, Ghent., pp. 80-90, 2013. [link]
  24. [276] T. Gu, Q. Liao, Y. Yang, and T. Li, Scheduling Divisible Loads from Multiple Input Sources in MapReduce, in Proc. CSE, pp. 1263-1270, 2013. DOI:10.1109/CSE.2013.188
  25. [277] G. Barlas, Cluster-Based Optimized Parallel Video Transcoding, Parallel Comput., vol. 38, pp. 226-244, 2012. DOI:10.1016/j.parco.2012.02.001
  26. [278] L. Ismail and L. Zhang, Modeling and Performance Analysis to Predict the Behavior of a Divisible Load Application in a Cloud Computing Environment, Algorithms, vol. 5, no. 2, pp. 289-303, 2012. DOI:10.3390/a5020289
  27. [279] L. Dai, Z. Shen, T. Chen, and Y. Chang, Analysis and Modeling of Task Scheduling in Wireless Network Based on Divisible Load Theory, International Journal on Communication Systems, 2012. DOI:10.1002/dac.2378
  28. [280] A. Mamat, Y. Lu, and J. Deogun, Efficient Real-Time Divisible Load Scheduling, J. Parallel Distrib. Comput., vol. 72, no. 12, pp. 1603-1616, 2012. DOI:10.1016/j.jpdc.2012.09.003
  29. [281] C. Rosas, Performance Improvement Methodology based on Divisible Load Theory for Data Intensive Applications. 2012. [link]
  30. [282] A. Mamat, Y. Lu, J. S. Deogun, and S. Goddard, Scheduling real-time divisible loads with advance reservations, Real Time Syst, vol. 48, no. 3, pp. 264-293, 2012. DOI:10.1007/S11241-011-9145-6
  31. [283] Y. Kyong and T. G. Robertazzi, Greedy Signature Processing with Arbitrary Location Distributions: A Divisible Load Framework, IEEE Trans. Aerosp. Electron. Syst., vol. 48, no. 4, pp. 3027-3041, 2012. DOI:10.1109/TAES.2012.6324675
  32. [284] M. Hu, J. Luo, and B. Veeravalli, Optimal provisioning for scheduling divisible loads with reserved cloud resources, in Proc. ICON, pp. 204-209, 2012. DOI:10.1109/ICON.2012.6506559
  33. [285] J. Berlinska and M. Drozdowski, Scheduling Divisible MapReduce Computations, J. Parallel Distrib. Comput., vol. 71, no. 3, pp. 450-459, 2011. DOI:10.1016/j.jpdc.2010.12.004
  34. [286] G. D. Barlas, A. Hassan, and Y. Jundi, An analytical Approach to the Design of Parallel Block Cipher Encryption/Decryption: A CPU/GPU Case Study, in Proc. PDP, Aiya Napa, Cyprus., pp. 247-251, 2011. DOI:10.1109/PDP.2011.51
  35. [287] M. Hu and B. Veeravalli, Scheduling hybrid divisible and indivisible loads on clusters, in Proc. ICON, pp. 141-146, 2011. DOI:10.1109/ICON.2011.6168521
  36. [288] C. Rosas, A. Morajko, J. Jorba, and E. César, Workload Balancing Methodology for Data-Intensive Applications with Divisible Load, in Proc. SBAC-PAD, pp. 48-55, 2011. DOI:10.1109/SBAC-PAD.2011.15
  37. [289] G. D. Barlas, An Analytical Approach to Optimizing Parallel Image Registration, IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 8, pp. 1074-1088, 2010. DOI:10.1109/TPDS.2009.164
  38. [290] G. D. Barlas, Optimizing Image Content-Based Query Applications over High Latency Communication Media using Single and Multiple Port Communications, Scalable Comput. Pract. Exp., vol. 11, no. 3, pp. 221-237, 2010. [link]
  39. [291] M. Abdullah, M. Othman, H. Ibrahim, and S. Subramaniam, Optimal Workload Allocation Model for Scheduling Divisible Data Grid Applications, Future Gener. Comput. Syst., vol. 26, pp. 971-978, 2010. DOI:10.1016/j.future.2010.04.003
  40. [292] O. Beaumont and A. Rosenberg, Link-Heterogeneity vs. Node-Heterogeneity in Clusters, in International Conference on High Performance Computing (HIPC), Goa, India, 2010. DOI:10.1109/HIPC.2010.5713172
  41. [293] C. Yu and D. C. Marinescu, Algorithms for Divisible Load Scheduling of Data-intensive Applications, J. Grid Comput., vol. 8, no. 1, pp. 133-155, 2010. DOI:10.1007/S10723-009-9129-0
  42. [294] X. Lin, A. Mamat, Y. Lu, J. S. Deogun, and S. Goddard, Real-time scheduling of divisible loads in cluster computing environments, J. Parallel Distrib. Comput., vol. 70, no. 3, pp. 296-308, 2010. DOI:10.1016/J.JPDC.2009.11.009
  43. [295] L. Ismail and L. Zhang, Modeling and Performance Analysis to Predict the Behavior of a Divisible Load Application in a Star Network Cloud, in Proc. EMS, pp. 369-374, 2010. DOI:10.1109/EMS.2010.67
  44. [296] A. Mamat, Y. Lu, J. S. Deogun, and S. Goddard, An Efficient Algorithm for Real-Time Divisible Load Scheduling, in Proc. IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 323-332, 2010. DOI:10.1109/RTAS.2010.29
  45. [297] J. Berlińska and M. Drozdowski, Dominance properties for divisible MapReduce computations, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Res. Rep. RA-09/09, 2009. [link]
  46. [298] M. A. Moges and T. G. Robertazzi, Grid scheduling divisible loads from two sources, Comput. Math. Appl., vol. 58, pp. 1081-1092, 2009. DOI:10.1016/j.camwa.2009.07.046
  47. [299] M. Shokripour and M. Othman, Categorizing DLT researches and its applications, European Journal of Scientific Research, vol. 37, no. 3, pp. 496-515, 2009. [link]
  48. [300] A. Shokripour and M. Othman, Categorizing Researches about DLT in Ten Groups, in International Association of Computer Science and Information Technology Spring Conference, pp. 45-49, 2009. DOI:10.1109/IACSIT-SC.2009.54
  49. [301] W. Shih, C. Yang, and S. Tseng, Using a Performance-based Skeleton to Implement Divisible Load Applications on Grid Computing Environments, J. Inf. Sci. Eng., vol. 25, no. 1, pp. 58-81, 2009. [link]
  50. [302] V. Korkhov, J. T. Moscicki, and V. V. Krzhizhanovskaya, The User-Level Scheduling of Divisible Load Parallel Applications With Resource Selection and Adaptive Workload Balancing on the Grid, IEEE Syst. J, vol. 3, no. 1, pp. 121-130, 2009. DOI:10.1109/JSYST.2008.2011301
  51. [303] M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam, New Optimal Load Allocation for Scheduling Divisible Data Grid Applications, in Proc. ICCS, pp. 165-174, 2009. DOI:10.1007/978-3-642-01970-8_17
  52. [304] S. Chuprat, S. Salleh, and S. Goddard, Real-Time Divisible Load Theory: A Perspective, in Proc. ICPP Workshops, pp. 6-10, 2009. DOI:10.1109/ICPPW.2009.29
  53. [305] E. Said and L. Nguyen The, A dynamic grid scheduler with a resource selection policy, in Lecture Notes in Computer Science, pp. 190-200, 2009.
  54. [306] K. Ko and T. G. Robertazzi, Signature search time evaluation in flat file databases, IEEE Trans. Aerosp. Electron. Syst., vol. 44, no. 2, pp. 493-502, 2008. DOI:10.1109/TAES.2008.4560202
  55. [307] G. D. Barlas and K. Fakih, A GA-Based Movie-on-Demand Platform using Multiple Distributed Servers, Multimedia Tools and Applications, vol. 40, no. 3, pp. 361-383, 2008. DOI:10.1007/s11042-008-0211-6
  56. [308] R. Suda, Divisible Load Scheduling with Improved Asymptotic Optimality, in IEEE International Conference on Cluster Comput, pp. 262-267, 2008. DOI:10.1109/CLUSTR.2008.4663779
  57. [309] G. D. Barlas, B. El-Koussa, and M. Afrasiabi, Using a GPU-CPU Hybrid Platform for Image Restoration, in Proc. 21 st International Conference on Parallel and Distributed Computing and Communication Systems (PDCCS), New Orleans, USA, pp. 82-87, 2008.
  58. [310] D. Luong, J. S. Deogun, and S. Goddard, Feedback scheduling of real-time divisible loads in clusters, SIGBED Rev, vol. 5, no. 2, pp. 2, 2008. DOI:10.1145/1399583.1399585
  59. [311] A. Mamat, Y. Lu, J. S. Deogun, and S. Goddard, Real-Time Divisible Load Schedulingwith Advance Reservation, in Proc. ECRTS, pp. 37-46, 2008. DOI:10.1109/ECRTS.2008.23
  60. [312] M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam, A2DLT: Divisible Load Balancing Model for Scheduling Communication-Intensive Grid Applications, in Proc. ICCS, pp. 246-253, 2008. DOI:10.1007/978-3-540-69384-0_30
  61. [313] K. Wang, X. Zhou, and S. Zhou, Scheduling Framework and Algorithms for Large-Scale Divisible Load Processing with Multi-Dimensional QoS Constraints, in Proc. ICYCS, pp. 2032-2037, 2008. DOI:10.1109/ICYCS.2008.243
  62. [314] M. Abdullah, M. Othman, H. Ibrahim, and S. Subramaniam, Simulated annealing algorithm for scheduling divisible load in large scale data grids, in International Conference on Computer and Communication Engineering, pp. 1032-1036, 2008.
  63. [315] M. Abdullah, M. Othman, H. Ibrahim, and S. Subramaniam, A new load balancing scheduling model in data grid application, in International Symposium on Information Technology, pp. 1-5, 2008.
  64. [316] S. Chuprat and S. Baruah, Scheduling divisible real-time loads on clusters with varying processor start times, in 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 15-24, 2008.
  65. [317] S. Chuprat, S. Salleh, and S. K. Baruah, Evaluation of a linear programming approach towards scheduling divisible real-time loads, in International Symposium on Information Technology, pp. 1-8, 2008.
  66. [318] C.-H. Hsu, T.-L. Chen, and J.-H. Park, On improving resource utilization and system throughput of master-slave job scheduling in heterogeneous systems, J. Supercomput., vol. 45, no. 1, pp. 129-150, 2008.
  67. [319] Y. Jingnan, G. Jiani, and B. L. Narayan, Ordered round-robin: An efficient sequence preserving packet scheduler, IEEE Trans. Comput., vol. 57, no. 12, pp. 1690-1703, 2008.
  68. [320] A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, J. Sched., vol. 11, no. 5, pp. 381-404, 2008.
  69. [321] X. Li, H. Kang, and J. Cao, Coordinated workload scheduling in hierarchical sensor networks for data fusion applications, J. Comput. Sci. Technol., vol. 23, no. 3, pp. 355-364, 2008.
  70. [322] A. Pugliese, D. Talia, and R. Yahyapour, Modeling and supporting grid scheduling, J. Grid Comput., vol. 6, no. 2, pp. 195-213, 2008.
  71. [323] P. Thysebaert, M. D. Leenheer, B. Volckaert, F. De Turck, B. Dhoedt, and P. Demeester, Scalable dimensioning of resilient lambda grids, Future Gener. Comput. Syst., vol. 24, no. 6, pp. 549-560, 2008.
  72. [324] J. Yao, J. Guo, and L. Bhuyan, Fair link striping with {FIFO, Comput. Commun., vol. 31, no. 14, pp. 3427-3437, 2008.
  73. [325] S. Viswanathan, B. Veeravalli, and T. G. Robertazzi, Resource aware distributed scheduling strategies for large-scale computational cluster/grid systems, IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 10, pp. 1450-1461, 2007. DOI:10.1109/TPDS.2007.1073
  74. [326] D. H. P. Low, B. Veeravalli, and D. Bader, On the Design of High-Performance Algorithms for Aligning Multiple Protein Sequences in Mesh-Based Multiprocessor Architectures, J. Parallel Distrib. Comput., vol. 67, no. 9, pp. 1007-1017, 2007. DOI:10.1016/j.jpdc.2007.03.007
  75. [327] N. T. Loc and S. Elnaffar, A Dynamic Scheduling Algorithm for Divisible Loads in Grid Environments, Journal of Communications, vol. 2, no. 4, pp. 57-64, 2007. DOI:10.4304/jcm.2.4.57-64
  76. [328] X. Lin, Y. Lu, J. Deogun, and S. Goddard, Real-Time Divisible Load Scheduling for Cluster Computing, in 13th IEEE Real-Time/Embedded Technology and Applications Symposium (RTAS), Bellevue WA, 2007. DOI:10.1109/RTAS.2007.29
  77. [329] X. Lin, Y. Lu, J. Deogun, and S. Goddard, Real-Time Divisible Load Scheduling with Different Processor Available Times, in International Conference on Parallel Processing (ICPP), XiAn, China, 2007. DOI:10.1109/ICPP.2007.70
  78. [330] X. Lin, Y. Lu, J. Deogun, and S. Goddard, Enhanced Real-Time Divisible Load Scheduling with Different Processor Available Times, in 14th International Conference on High Performance Computing ( HiPC ), Goa, India, 2007. DOI:10.1007/978-3-540-77220-0_30
  79. [331] J. Hu and R. Klefstad, Scheduling Multiple Divisible and Indiviisble Tasks on Bus Networks, in IEEE International Conference on Cluster Comput, pp. 222-230, 2007. DOI:10.1109/CLUSTR.2007.4629235
  80. [332] X. Li, X. Liu, and H. Kang, Sensing Workload Scheduling in Sensor Networks Using Divisible Load Theory, in Proc. GLOBECOM, pp. 785-789, 2007. DOI:10.1109/GLOCOM.2007.152
  81. [333] M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam, Adaptive Divisible Load Model for Scheduling Data-Intensive Grid Applications, in Proc. International Conference on Computational Science., pp. 446-453, 2007. DOI:10.1007/978-3-540-72584-8_59
  82. [334] K. Katsaros and G. C. Polyzos, Optimizing operation of a hierarchical campus-wide mobile grid, in 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2007.
  83. [335] H. Li, G. Sun, and Y. Xu, Distributed scheduling strategies for processing multiple divisible loads with unknown network resources, in International Conference on Network and Parallel Computing Workshops, pp. 824-829, 2007.
  84. [336] X. Li, H. Kang, and H.-H. Chen, Sensing workload scheduling in hierarchical sensor networks for data fusion applications, in International Conference on Wireless Communications and Mobile Computing (IWCMC), pp. 214-219, 2007.
  85. [337] X. Lin, Y. Lu, J. Deogun, and S. Goddard, Enhancing real-time scheduling of divisible loads by utilizing inserted idle time, in 14th IEEE International Conference on High Performance Computing (HiPC), 2007.
  86. [338] M. W. Margo, K. Yoshimoto, P. Kovatch, and P. Andrews, Impact of reservations on production job scheduling, in Lecture Notes in Computer Science, pp. 116-131, 2007.
  87. [339] A. Plaza, J. Plaza, and D. Valencia, Impact of platform heterogeneity on the design of parallel algorithms for morphological processing of high-dimensional image data, J. Supercomput., vol. 40, no. 1, pp. 81-107, 2007.
  88. [340] L. Xiaorong, B. Veeravalli, and V. K. Prasanna, A window-assisted video partitioning strategy for partitioning and caching video streams in distributed multimedia systems, J. Parallel Distrib. Comput., vol. 67, no. 6, pp. 738-754, 2007.
  89. [341] M. Moges and T. G. Robertazzi, Wireless sensor networks: Scheduling for measurement and data reporting, IEEE Trans. Aerosp. Electron. Syst., vol. 42, no. 1, pp. 327-340, 2006. DOI:10.1109/TAES.2006.1603426
  90. [342] H. Gonzalez-Velez, Self-Adaptive Skeletal Task Farm for Computational Grids, Parallel Comput.-8, vol. 7, pp. 479-490, 2006. DOI:10.1016/j.parco.2006.07.002
  91. [343] G. D. Barlas, A Taxonomy and DLT Based Analysis of Cluster-based Video Trans/Encoding, in 14 th Euromicro Conference on Parallel, Distributed and Network-based Processing (PDIVM), Montbeliard, France, pp. 388-395, 2006. DOI:10.1109/PDP.2006.15
  92. [344] T. G. Robertazzi and D. Yu, Multi-Source Grid Scheduling for Divisible Loads, in Proc. CISS, pp. 188-191, 2006. DOI:10.1109/CISS.2006.286459
  93. [345] S. Boutammine, D. Millot, and C. Parrot, Dynamically Scheduling Divisible Load for Grid Computing, in Proc. HPCC, pp. 763-772, 2006. DOI:10.1007/11847366_79
  94. [346] T. Zhu, Y. Wu, and G. Yang, Scheduling divisible loads in the dynamic heterogeneous grid environment, in Proc. Infoscale, pp. 8, 2006. DOI:10.1145/1146847.1146855
  95. [347] S.-S. Boutammine, D. Millot, and C. Parrot, An adaptive scheduling method for grid computing, in Lecture Notes in Computer Science, pp. 188-197, 2006.
  96. [348] S. Elnaffar, T. Nguyen, T. Katayama, and T. Ho, {MRRS, in IEEE/ACM International Conference on Signal-Image Technology and Internet-based Systems, pp. 35-42, 2006.
  97. [349] Y. Han, C.-H. Youn, T. M. Trung, W.-S. Kim, and L. Zhang, Optimal load scheduling mechanism and a mobile-to-grid gateway model for e-health service in wireless grid, in Sixth IEEE International Conference on Computer and Information Technology, pp. 54-60, 2006.
  98. [350] A. Legrand and A. Su, Minimizing the stretch when scheduling flows of biological requests, in 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 103-112, 2006.
  99. [351] L. Maozhen, Y. Bin, and Q. Man, {PGGA, Future Gener. Comput. Syst., vol. 22, no. 5, pp. 588-599, 2006.
  100. [352] B. Veeravalli, L. Chen, H. Y. Kwoon, G. K. Whee, S. Y. Lai, L. P. Hian, and H. C. Chow, Design, analysis, and implementation of an agent driven pull-based distributed video-on-demand system, Multimedia Tools Appl., vol. 28, no. 1, pp. 89-118, 2006.
  101. [353] B. Volckaert, P. Thysebaert, M. D. Leenheer, F. D. Turck, B. Dhoedt, and P. Demeester, Flexible grid service management through resource partitioning, J. Supercomput., vol. 38, no. 3, pp. 279-305, 2006.
  102. [354] F. de O. Lucchese, E. J. H. Yero, F. S. Sambatti, and M. A. A. Henriques, An Adaptive Scheduler for Grids, J. Grid Comput., vol. 4, no. 1, pp. 1-17, 2006. DOI:10.1007/s10723-005-9006-4
  103. [355] P. Li, B. Veeravalli, and A.A. Kassim, Design and Implementation of Parallel Video Encoding Strategies using Divisible Load Analysis, to appear in IEEE Transactions on Circuits and Systems for Video technology (CSVT), vol. 15, no. 9, pp. 1098-1112, 2005. DOI:10.1109/TCSVT.2005.852627
  104. [356] B. Veeravalli, Design and Performance Analysis of Heuristic Load Balancing Strategies for Processing Divisible Loads on Ethernet Clusters. International Journal of Computers and Applications, ACTA Press, 2005. DOI:10.2316/journal.202.2005.2.204-0511
  105. [357] S. Suresh, S.N. Omkar, and V. Mani, Parallel Implementation of Back-Propagation Algorithm in Network of Workstations, IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 1, pp. 23-34, 2005. DOI:10.1109/TPDS.2005.11
  106. [358] D. Ghose and H. J. Kim, Computing BLAS Level-2 Operations on Workstation Clusters using the Divisible Load Paradigm, Mathematical and Computing Modeling, vol. 41, no. 1, pp. 49-70, 2005. DOI:10.1016/j.mcm.2004.01.004
  107. [359] G. D. Barlas, VoD on Steroids: Optimized Content Delivery using Distributed Video Servers over Best-Effort Internet, J. Parallel Distrib. Comput., vol. 65, no. 9, pp. 1057-1071, 2005. DOI:10.1016/j.jpdc.2005.04.001
  108. [360] D. Ghose, H. J. Kim, and T. H. Kim, Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources, IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 10, 2005. DOI:10.1109/TPDS.2005.117
  109. [361] G. D. Barlas and B. Veeravalli, Optimized Distributed Delivery of Continuous-Media Documents over Unreliable Communication Links, IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 10, 2005. DOI:10.1109/TPDS.2005.125
  110. [362] Wong H.M. and B. Veeravalli, Aligning Biological Sequences on Distributed Bus Networks: A Divisible Load Scheduling Approach, IEEE Transactiosn on Information Technology in BioMedicine, vol. 9, no. 4, pp. 489-501, 2005. DOI:10.1109/TITB.2005.855559
  111. [363] P. Thysebaert, M. Leenheer, and B. Volckaert, Using Divisible Load Theory to Dimension Optical Transport Networks for Grid Excess Load Handling, in Proc. of the International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Service, ICAS/ICNS, 2005. DOI:10.1109/ICAS-ICNS.2005.97
  112. [364] P. Thysebaert, B. Volckaert, and M. Leenheer, Resource Partitioning Algorithms in a Programmable Service Grid Architecture. ICCS, Lecture Notes in Computer Science, Springer, LNCS, 2005. DOI:10.1007/11428862_35
  113. [365] G. D. Barlas, Simulating the Effects of Packet Loss on the Delivery of Continuous Media by Multiple Distributed Servers, in Proc. ICMSAO'05, Sharjah, U.A.E, 2005.
  114. [366] K. v. d. Raadt, Y. Yang, and H. Casanova, Practical Divisible Load Scheduling on Grid Platforms with APST-DV, in Proc. IPDPS, 2005. DOI:10.1109/IPDPS.2005.351
  115. [367] N. T. Loc, S. Elnaffar, T. Katayama, and T. B. Ho, A Scheduling Method for Divisible Workload Problem in Grid Environments, in Proc. PDCAT, pp. 513-517, 2005. DOI:10.1109/PDCAT.2005.46
  116. [368] J. Guo, J. Yao, and L. Bhuyan, An efficient packet scheduling algorithm in network processors, in 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 807-818, 2005.
  117. [369] M. A. Moges, D. Yu, and T. G. Robertazzi, Divisible load scheduling with multiple sources: Closed form solutions, in Conference on Information Sciences and Systems (CISS), 2005.
  118. [370] J. Yu and R. Buyya, A Taxonomy of Workflow Management Systems for Grid Computing, J. Grid Comput., vol. 3, no. 3--4, pp. 171-200, 2005. DOI:10.1007/s10723-005-9010-8
  119. [371] K. Ko and T. G. Robertazzi, Equal allocation scheduling for data intensive applications, IEEE Trans. Aerosp. Electron. Syst., vol. 40, no. 2, pp. 695-705, 2004. DOI:10.1109/TAES.2004.1310014
  120. [372] J. Yao and B. Veeravalli, Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs, Cluster Comput., vol. 7, no. 2, pp. 841-865, 2004. DOI:10.1023/b:clus.0000018567.06753.de
  121. [373] S. Kim and J. B. Weissman, A Genetic Algorithm Based Approach for Scheduling Decomposable Data Grid Applications, in International Conference on Parallel Processing (ICPP'04), Montreal, Quebec, Canada, 2004. DOI:10.1109/ICPP.2004.1327949
  122. [374] M. Moges and T. Robertazzi, Grid scheduling divisible loads from multiple sources via linear programming, in International Conference on Parallel and Distributed Computing and Systems (PDCS), pp. 423-428, 2004.
  123. [375] S. Viswanathan, B. Veeravalli, D. Yu, and T. G. Robertazzi, Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems, in International Conference on Grid Computing (GRID), pp. 163-170, 2004.
  124. [376] V. Bharadwaj, D. Ghose, and T. G. Robertazzi, A new paradigm for load scheduling in distributed systems, Cluster Comput., vol. 6, no. 1, pp. 7-18, 2003. DOI:10.1023/a:1020958815308
  125. [377] H. M. Wong, D. Yu, B. Veeravalli, and T. G. Robertazzi, Data intensive grid scheduling: Multiple sources with capacity constraints, in Proc. IASTED Int. Conf. Parallel Distrib. Comput. Syst. (PDCS), 2003.
  126. [378] X. Li, B. Veeravalli, and C. C. Ko, Distributed Image Processing on a Network of Workstations. International Journal of Computers and Applications, ACTA Press, 2003. DOI:10.14711/thesis-b447475
  127. [379] W. Glazek, A Multistage Load Distribution Strategy for Three Dimensional Meshes. special issue of Cluster Comput. on Divisible Load Scheduling, Kluwer Academic Publishers, Jan, 2003. DOI:10.1023/a:1020962916217
  128. [380] H.-J. Kim, A Novel Optimal Load Distribution Algorithm for Divisible Loads. special issue of Cluster Comput. on Divisible Load Scheduling, Kluwer Academic Publishers, Jan, 2003. DOI:10.1023/a:1020915000287
  129. [381] K. Li, Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks. special issue of Cluster Comput. on Divisible Load Scheduling, Kluwer Academic Publishers, Jan, 2003. DOI:10.1023/a:1020967017125
  130. [382] V. Mani, An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Networks. special issue of Cluster Comput. on Divisible Load Scheduling, Kluwer Academic Publishers, Jan, 2003. DOI:10.1023/a:1020919101196
  131. [383] E. Balafoutis, M. Paterakis, P. Triantafillou, G. Nerjes, P. Muth, and G. Weikum, Clustered Scheduling Algorithms for Mixed Media Disk Workloads in a Multimedia Server. special issue of Cluster Comput. on Divisible Load Scheduling, Kluwer Academic Publishers, Jan, 2003. DOI:10.1023/a:1020923202104
  132. [384] M. Adler, Y. Gong, and A. L. Rosenberg, Optimal Sharing of Bags of Tasks in Heterogeneous Clusters, in Proc. of ACM SPAA'03, 2003. DOI:10.1145/777412.777414
  133. [385] D. Ghose and T. G. Robertazzi, Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling, Cluster Comput., vol. 6, no. 1, pp. 5, 2003. DOI:10.1023/A:1020902731238
  134. [386] S. Ranganath, Theoretical and Experimental Study of Large Size Image Processing Applications using Divisible Load Paradigm on Distributed Bus Networks, Image and Vision Computing, Elsevier Publishers, issues 13-14, vol. 20, pp. 917-936, 2002. DOI:10.1016/s0262-8856(02)00090-2
  135. [387] Debasish Ghose, A Feedback Strategy for Load Allocation in Workstation Clusters with Unknown Network Resource Capabilities using the DLT Paradigm, in Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), Las Vegas, Nevada, USA, pp. 425-428, 2002.
  136. [388] Debasish Ghose and Hyoung Joong Kim, Large Matrix-vector Product Computations on Multicast Bus-Oriented Workstation Clusters, in Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), Las Vegas, Nevada, USA, pp. 436-441, 2002.
  137. [389] S. K. Chan, V. Bharadwaj, and D. Ghose, Large matrix-vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation, Math. Comput. Simul., vol. 58, no. 1, pp. 71-92, 2001. DOI:10.1016/S0378-4754(01)00329-9
  138. [390] X. Li, V. Bharadwaj, and C. C. Ko, Experimental Study on Processing Divisible Loads for Large Size Image Processing Applications Using PVM Clusters, Int. J. Comput. Appl., 2001.
  139. [391] A. L. Rosenberg, Sharing Partitionable Workload in Heterogeneous NOWs: Greedier is Not Better, in Proc. of IEEE International Conference on Cluster Comput., Newport Beach CA, pp. 124-131, 2001. DOI:10.1109/CLUSTR.2001.959961
  140. [392] M. Drozdowski and P. Wolniewicz, Experiments with scheduling divisible tasks in clusters of workstations, in Euro-Par, ser. LNCS. Springer., pp. 311-319, 2000. DOI:10.1007/3-540-44520-x_40
  141. [393] V. Bharadwaj, X. Li, and C. C. Ko, Efficient Partitioning and Scheduling of Computer Vision and Image Processing Data on Bus Networks using Divisible Load Analysis, Image and Vision Computing, Aug., v 18 n 11, pp. 919, 2000. DOI:10.1016/s0262-8856(99)00085-2
  142. [394] V. Bharadwaj and G. D. Barlas, Access Time Minimization for Distributed Multimedia Applications, Multimedia Tools and Applications, vol. 12, pp. 235-256, 2000. DOI:10.1023/a:1009623825393
  143. [395] D. A. L. Piriyakumar, Distributed Computation for a Hypercube Network of Sensor-Driven Processors with Communication Delays Including Setup Time, IEEE Trans. Syst., Man, Cybern.-Part A: Systems and Humans., vol. 28, no. 2, pp. 245-251, 1998. DOI:10.1109/3468.661152
  144. [396] D. Ghose and H. J. Kim, Load Partitioning and Trade-Off Study for Large Matrix Vector Computations in Multicast Bus Networks with Communication Delays, J. Parallel Distrib. Comput., vol. 54, 1998. DOI:10.1006/jpdc.1998.1494
  145. [397] E. Haddad, Runtime Reallocation of Divisible Load under Processor Execution Deadlines, in Proc. Third Workshop on Parallel and Distributed Real-Time Systems, IEEE Computer Society Press, Santa Barbara., 1995. DOI:10.1109/WPDRTS.1995.470510
  146. [398] C. K. Lee and M. Hamdi, Parallel image processing applications on a network of workstations, Parallel Comput., vol. 21, no. 1, pp. 137-160, 1995.
  147. [399] E. Haddad, Communication Protocol for Optimal Redistribution of Divisible Load in Distributed Real-time Systems, in Proc. ISMM International Conference on Intelligent Information Management Systems, Washington DC, June 1-3, pp. 39-42, 1994.
  148. [400] S. Bataineh and T. G. Robertazzi, Bus oriented load sharing for a network of sensor driven processors, IEEE Trans. Syst., Man, Cybern., Se., vol. 21, no. 5, pp. 1202-1205, 1991. DOI:10.1109/21.120070
  149. [401] Y. C. Cheng and T. G. Robertazzi, Communication and computation tradeoffs in a linear network of sensors, in Proc. Comput. Netw. Symp., Washington, DC, USA, pp. 152-161, 1988. [link]
  150. [402] S. Suresh, V. Mani, S. N. Omkar, and H. J. Kim, Parallel Video Processing using Divisible Load Scheduling Paradigm, Korean Journal of Broadcast Engineering. [link]
  151. [403] G. N. Iyer, B. Veeravalli, and S. G. Krishnamoorthy, On Handling Large-Scale Polynomial Multiplication in Compute Cloud Environments using Divisible Load Paradigm, IEEE Trans. Aerosp. Electron. Syst., 201, pp. 820-831. DOI:10.1109/TAES.2012.6129672

Theses & reports

  1. [404] J. M. Marszałkowski, Scheduling divisible computations with energy constraints, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, 2020. [link]
  2. [405] C. Rosas, Performance Improvement Methodology based on Divisible Load Theory for Data Intensive Applications, Autonomous University of Barcelona, Spain, 2012. [link]
  3. [406] J. Berlińska, Scheduling divisible loads in heterogeneous distributed systems, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, 2011. [link]
  4. [407] A. Venkateshwaran, Design, implementation and experiments of sensing task scheduling in wireless sensor networks, Oklahoma State University, 2008.
  5. [408] J. Yao, Scheduling network applications based on divisible load theory ({DLT, University of California, Riverside, 2007.
  6. [409] M. Lawenda, Multi-installment divisible loads scheduling, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, 2006. [link]
  7. [410] J. Guo, Message scheduling in a cluster-based active router for multimedia applications, University of California, Riverside, 2006.
  8. [411] M. A. Moges, Modeling and performance analysis of arbitrarily divisible loads for sensor and grid networks, State University of New York at Stony Brook, 2005.
  9. [412] M. Drozdowski and M. Lawenda, The combinatorics in divisible load scheduling, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Tech. Rep. RA-012/04, 2004. [link]
  10. [413] M. Drozdowski, M. Lawenda, and F. Guinand, Scheduling multiple divisible loads, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Tech. Rep. RA-007/04, 2004. DOI:10.1109/ICPADS.2007.4447768
  11. [414] M. Drozdowski and P. Wolniewicz, The impact of communication buffer on processing divisible loads, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Tech. Rep. RA-002/04, 2004. [link]
  12. [415] P. Wolniewicz, Divisible job scheduling in systems with limited memory, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, 2003. [link]
  13. [416] T. G. Robertazzi, S. Luryi, and S. Charcranoon, Load sharing controller for optimizing resource utilization cost, U.S. Patent 6,370,560, 2002. [link] [PDF]
  14. [417] O. Beaumont, A. Legrand, and Y. Robert, Static Scheduling Strategies for Heterogeneous Systems, Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superieure de Lyon, 2002. [link]
  15. [418] O. Beaumont and A. Legrand, Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems, Research Report-36, Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superieure de Lyon, Lyon France, 2002. DOI:10.1109/IPDPS.2003.1213202
  16. [419] M. Drozdowski and P. Wolniewicz, On the complexity of divisible job scheduling with limited memory buffers, Inst. Comput. Sci., Poznań Univ. Technol., Poznań, Poland, Tech. Rep. RA-001/, 2001. [link]
  17. [420] M. Drozdowski and P. Wolniewicz, On the Complexity of Divisible Job Scheduling, Technical Report RA-001/, Poznan University of Technology. Available as pkzipped PostScript (43kB): www.cs.put.poznan.pl/mdrozdowski/rapIIn/div_mNPh.zip, 2001. [link]
  18. [421] T. G. Robertazzi, S. Luryi, and J. Sohn, Load sharing controller for optimizing monetary cost, U.S. Patent 5,889,989, 1999. [link] [PDF]
  19. [422] G. Zhang and S. S. Rappaport, Heuristic algorithms for optimizing computing and communication costs for networked computer utilities, College of Engineering and Applied Sciences, SUNY Stony Brook, 1998. [link]
  20. [423] V. Bharadwaj, D. Ghose, and V. Mani, Design and Analysis of Load Distribution Strategies for Infinitely Divisible Loads in Distributed Processing Networks with Communication Delays, Dept. of Aerospace Engineering, Indian Institute of Science, 1992.
  21. [424] V. Bharadwaj, D. Ghose, and V. Mani, A Study of Optimality Conditions for Load Distribution in Tree Networks with Communication Delays, Dept. of Aerospace Engineering, Indian Institute of Science, 1992.
  22. [425] T. Hsiung and T. G. Robertazzi, Performance evaluation of distributed communication systems for load balancing, College of Engineering and Applied Sciences, SUNY Stony Brook, 1991. [link]
  23. [426] O. Beaumont and L. Marchal, A Novel Form for Scheduling Work Preserving Malleable Tasks and Its Applications, INRIA Technical Report 00564056. Available online at http://hal.inria.fr/inria-00564056. [link]

General

  1. [427] H. Casanova, A. Legrand, and Y. Robert, Parallel Algorithms. CRC Press, 2008. [link]