{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T07:24:07Z","timestamp":1767597847385,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":142,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642085710"},{"type":"electronic","value":"9783662043035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-662-04303-5_6","type":"book-chapter","created":{"date-parts":[[2013,2,2]],"date-time":"2013-02-02T00:35:32Z","timestamp":1359765332000},"page":"263-341","source":"Crossref","is-referenced-by-count":6,"title":["Management of Resources in Parallel Systems"],"prefix":"10.1007","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Drozdowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Ecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K., Local Search in Combinatorial Optimization, J.Wiley, New York, 1997."},{"key":"6_CR2","unstructured":"Aho, A.V._, Hoperoft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(90)90166-U","volume":"35","author":"M Ahuja","year":"1990","unstructured":"Ahuja, M., Zhu, Y., An O(logn) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Information Processing Letters 35, 1990, 7\u201311.","journal-title":"Information Processing Letters"},{"key":"6_CR4","volume-title":"University of Minessota Supercomputing Institute","author":"W Alda","year":"1993","unstructured":"Alda, W., Dzwinel, W., Kitowski, J., Moscinski, J., Yuen, D.A., Penetration mechanics via molecular dynamics. Research Report UMSI 93\/58, University of Minessota Supercomputing Institute, 1993."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0743-7315(90)90116-7","volume":"9","author":"FD Anger","year":"1990","unstructured":"Anger, F.D., Hwang, J., Chow, Y., Scheduling with sufficiently loosely coupled processors, J. Parallel Distributed Comput. 9, 1990, 87\u201392.","journal-title":"J. Parallel Distributed Comput."},{"key":"6_CR6","first-page":"252","volume":"94","author":"E Bampis","year":"1996","unstructured":"Bampis, E., Giannokos, A., K\u00f6nig, J.-C., On the complexity of scheduling with large communication delays, European Journal of Operational Research 94, 1996, 252\u2013260.","journal-title":"Research"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1109\/12.324544","volume":"43","author":"S Bataineh","year":"1994","unstructured":"Bataineh, S., Hsiung, T.-Y., Robertazzi, T.G., Closed form solutions for bus and tree networks of processors load sharing a divisible job, IEEE Transactions on Computers 43, 1994, 1184\u20131196.","journal-title":"Ieee Transactions on Computers"},{"key":"6_CR8","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R., Dynamic Programming, Princeton University Press, Princeton, N.J., 1957."},{"key":"6_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"R Bellman","year":"1962","unstructured":"Bellman, R., Dreyfus, S.E., Applied Dynamic Programming, Princeton University Press, Princeton, N.J., 1962."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1109\/71.308534","volume":"5","author":"V Bharadwaj","year":"1994","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., Optimal sequencing and arrangement in distributed single-level tree networks with communication delays, IEEE Transactions on Parallel and Distributed Systems 5, 1994, 968\u2013976.","journal-title":"Ieee Transactions on Parallel and Distributed Systems"},{"key":"6_CR11","first-page":"555","volume":"31","author":"V Bharadwaj","year":"1995","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., Multi-installment load distribution in tree networks with delays, IEEE Transactions on Aerospace and Electronic Systems 31, 1995, 555\u2013567.","journal-title":"Electronic Systems"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0898-1221(95)00039-2","volume":"29","author":"V Bharadwaj","year":"1995","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., An efficient load distribution strategy for a distributed linear network of processors with communication delays, Computers and Matheamtics with Applications 29, 1995, 95\u2013112.","journal-title":"Matheamtics with Applications"},{"key":"6_CR13","volume-title":"Scheduling Divisible Loads in Parallel and Distributed Systems","author":"V Bharadwaj","year":"1996","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T., Scheduling Divisible Loads in Parallel and Distributed Systems, IEEE Computer Society Press, Los Alamitos CA, 1996."},{"key":"6_CR14","volume-title":"State University of New York at Stony Brook","author":"S Bataineh","year":"1992","unstructured":"Bataineh, S., Robertazzi, T.G., Ultimate performance limits for networks of load sharing processors, CEAS Technical Report 623, State University of New York at Stony Brook, 1992."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0166-5316(94)90058-2","volume":"20","author":"L Bianco","year":"1994","unstructured":"Bianco, L., Blatiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Scheduling preemptive multiprocessor tasks on dedicated processors, Performance Evaluation 20, 1994, 361\u2013371.","journal-title":"Performance Evaluation"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF02057160","volume":"58","author":"L Bianco","year":"1995","unstructured":"Bianco, L., Blatiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58, 1995, 493\u2013517.","journal-title":"Annals of Operations Research"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(96)00035-2","volume":"72","author":"L Bianco","year":"1997","unstructured":"Bianco, L., Blatiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Discrete Applied Mathematics 72, 1997, 25\u201346.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1018994726051","volume":"70","author":"L Bianco","year":"1997","unstructured":"Bianco, L., Blatiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Preemptive multiprocessor task scheduling with release times and time windows, Annals of Operations Research 70, 1997, 43\u201355.","journal-title":"Annals of Operations Research"},{"key":"6_CR19","first-page":"939","volume":"41","author":"L Bianco","year":"1994","unstructured":"Bianco, L., Dell\u2019Olmo, P., Speranza, M.G., Nonpreemptive scheduling of independent tasks with prespecified processor allocations, Naval Research Logistics Quarterly 41, 1994, 939\u2013971.","journal-title":"Quarterly"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Blanc, J.-Y., Trystram, D., Implementation of parallel numerical routines using broadcast communication schemes, E.Burkhart (ed.), Lecture Notes in Computer Science 457, CONPAR 90-VAPP IV, Joint International Conference on Vector and Parallel Processing, Springer-Verlag, Berlin, 1990, 467\u2013478.","DOI":"10.1007\/3-540-53065-7_125"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(96)00062-2","volume":"58","author":"J Blaiewicz","year":"1996","unstructured":"Blaiewicz, J., Bouvry, P., Guinand, F., Trystram, D., Scheduling complete in-trees on two uniform processors with communication delays, Information Processing Letters 58, 1996, 255\u2013263.","journal-title":"Information Processing Letters"},{"key":"6_CR22","unstructured":"Blaiewicz, J., Cellary, W., Wgglarz, J., Deterministyczne problemy szeregowania zadan na r\u00f3wnoleglych procesorach, Cz. II, Zbiory zadan zaleinych, Podstawy Sterowania, 1976, 297\u2013320."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/0167-8191(95)00046-1","volume":"21","author":"J Blaiewicz","year":"1995","unstructured":"Blaiewicz, J., Drozdowski, M., Scheduling divisible jobs on hyper-cubes, Parallel Computing 21, 1995, 1945\u20131956.","journal-title":"Parallel Computing"},{"key":"6_CR24","first-page":"3","volume":"21","author":"J Blaiewicz","year":"1996","unstructured":"Blaiewicz, J., Drozdowski, M., Performance limits of two-dimensional network of load-sharing processors, Foundations of Computing and Decision Sciences 21, 1996, 3\u201315.","journal-title":"Decision Sciences"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(96)00115-1","volume":"76","author":"J Blaiewicz","year":"1997","unstructured":"Blaiewicz, J., Drozdowski, M., Scheduling divisible jobs with communication startup costs, Discrete Applied Mathematics 76, 1997, 21\u201341.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0166-218X(99)00013-X","volume":"94","author":"J Blaiewicz","year":"1999","unstructured":"Blaiewicz, J., Drozdowski, M., Guinand, F., Trystram, D., Scheduling under architectural constraints, Discrete Applied Mathematics 94, 1999, 35\u201350.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0167-8191(98)00104-5","volume":"25","author":"J Blaiewicz","year":"1999","unstructured":"Blaiewicz, J., Drozdowski, M., Markiewicz, M., Divisible task scheduling\u2013concept and verification, Parallel Computing 25, 1999, 87\u201398.","journal-title":"Parallel Computing"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","volume":"41","author":"J Blaiewicz","year":"1992","unstructured":"Blaiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Speranza, M.G., Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41, 1992, 275\u2013280.","journal-title":"Information Processing Letters"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(94)90066-3","volume":"49","author":"J Blaiewicz","year":"1994","unstructured":"Blaiewicz, J., Drozdowski, M., Dell\u2019Olmo, P., Speranza, M.G., Corrigendum: Information Processing Letters 49, 1994, 269\u2013270.","journal-title":"Information Processing Letters"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0167-8191(94)90110-4","volume":"20","author":"J Blaiewicz","year":"1994","unstructured":"Blaiewicz, J., Drozdowski, M., Schmidt, G., de Werra, D., Scheduling independent multiprocessor tasks on a uniform k-processor system, Parallel Computing 20, 1994, 15\u201328.","journal-title":"Parallel Computing"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0020-0190(84)90006-1","volume":"18","author":"J Blaiewicz","year":"1984","unstructured":"Blaiewicz, J., Drabowski, M., Wgglarz, J., Scheduling independent 2processor tasks to minimize schedule length, Information Processing Letters 18, 1984, 267\u2013273.","journal-title":"Information Processing Letters"},{"key":"6_CR32","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"-35","author":"J. Blaiewicz","year":"1986","unstructured":"Blaiewicz, J., Drabowski, M., Wgglarz, J., Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers C-35, 1986, 389\u2013393.","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(95)00020-R","volume":"65","author":"J Blaiewicz","year":"1996","unstructured":"Blaiewicz, J., Drozdowski, M., de Werra, D., Wgglarz, J., Deadline scheduling of multiprocessor tasks, Discrete Applied Mathematics 65, 1996, 81\u201396.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0167-6377(83)90042-1","volume":"2","author":"J Blaiewicz","year":"1983","unstructured":"Blaiewicz, J., Ecker, K., A linear time algorithm for restricted bin packing and scheduling problems, Operations Research Letters 2, 1983, 80\u201383.","journal-title":"Operations Research Letters"},{"key":"6_CR35","volume-title":"New York","author":"J Blaiewicz","year":"1996","unstructured":"Blaiewicz, J., Ecker, K., Pesch, E., Schmidt, G., Wgglarz, J., Scheduling Computer and Manufacturing Processes, Springer Verlag, Heidelberg, New York, 1996."},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blaiewicz","year":"1983","unstructured":"Blaiewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G., Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics 5, 1983, 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR37","first-page":"231","volume":"94","author":"J Blaiewicz","year":"1996","unstructured":"Blaiewicz, J., Liu, Z., Scheduling multiprocessor tasks with chain constraints, European Journal of Operational Research 94, 1996, 231\u2013241.","journal-title":"Research"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01719698","volume":"16","author":"P Brucker","year":"1994","unstructured":"Brucker, P., A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs, OR Spektrum 16, 1994, 5\u20137.","journal-title":"Or Spektrum"},{"key":"6_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Scheduling Algorithms, Springer, Berlin, 1998."},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1287\/moor.2.3.275","volume":"2","author":"PJ Brucker","year":"1977","unstructured":"Brucker, P.J., Garey, M.R., Johnson, D.S., Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness, Mathematics of Operations Research 2, 1977, 275\u2013284.","journal-title":"Mathematics of Operations Research"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny, V., Thermodynamical approach to the trvaling salesman problem; an efficient simulation algorithm, J. Optimization Theory and Applications 45, 1985, 41\u201351.","journal-title":"J. Optimization Theory and Applications"},{"key":"6_CR42","first-page":"471","volume":"15","author":"RS Chang","year":"1988","unstructured":"Chang, R.S., Lee, R.C.T., On a scheduling problem where a job can be executed only by a limited number of processors, Computers and Operations Research 15, 1988, 471\u2013478.","journal-title":"Operations Research"},{"key":"6_CR43","first-page":"409","volume":"16","author":"YL Chen","year":"1989","unstructured":"Chen, Y.L., Chin, Y.H., Scheduling unit-time job on processors with different capabilities, Computers and Operations Research 16, 1989, 409\u2013417.","journal-title":"Operations Research"},{"key":"6_CR44","first-page":"700","volume":"24","author":"YC Cheng","year":"1988","unstructured":"Cheng, Y.-C., Robertazzi, T.G., Distributed computation with communication delay, IEEE Transactions on Aerospace and Electronic Systems 24, 1988, 700\u2013712.","journal-title":"Electronic Systems"},{"key":"6_CR45","first-page":"225","volume":"2","author":"P Chretienne","year":"1981","unstructured":"Chretienne, P., A polynomial algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints, European Journal of Operational Research 2, 1981, 225\u2013230.","journal-title":"Journal of Operational Research"},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0166-218X(94)90205-4","volume":"49","author":"P Chretienne","year":"1994","unstructured":"Chretienne, P., Tree scheduling with communication delays, Discrete Applied Mathematics 49, 1994, 129\u2013141.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR47","volume-title":"New York","author":"P Chretienne","year":"1995","unstructured":"Chretienne, P., Coffman Jr., E.G., Lenstra, J.K., Liu, Z., (eds), Scheduling Theory and its Applications, New York, 1995."},{"key":"6_CR48","volume-title":"The basic scheduling problem with interprocessor communication delays, Masi Report 91\/6","author":"P Chretienne","year":"1991","unstructured":"Chretienne, P., Picouleau, C., The basic scheduling problem with interprocessor communication delays, MASI Report 91\/6, Institut Blaise Pascal, Paris, 1991."},{"key":"6_CR49","unstructured":"Coffman Jr., E.G., (ed.), Computer and Job-Shop Scheduling Theory, New York, 1976."},{"key":"6_CR50","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"EG Coffman Jr.","year":"1985","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., La Paugh, A.S., Scheduling file transfers, SIAM J. on Computing 14, 1985, 744\u2013780.","journal-title":"Siam J. on Computing"},{"key":"6_CR51","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman Jr.","year":"1972","unstructured":"Coffman Jr., E.G., Graham, R.J., Optimal scheduling for twoprocessor systems, Acta Informatica 1, 1972, 200\u2013213.","journal-title":"Acta Informatica"},{"key":"6_CR52","doi-asserted-by":"crossref","first-page":"680684","DOI":"10.1287\/opre.39.4.680","volume":"39","author":"I.Y. Colin","year":"1991","unstructured":"Colin, I.Y., Chretienne, P., C.P.M. scheduling with small communication delays and task duplication, Operations Research 39 1991, 680684.","journal-title":"Operations Research"},{"key":"6_CR53","unstructured":"Culler, D.E., Karp, R.M., Patterson, D.A., Sahay,A., Schauser, K.E."},{"key":"6_CR54","volume-title":"Fourth Acm Sigplan Symposium on Principles and Practice of Parallel Programming","author":"E Santos","year":"1993","unstructured":"Santos, E., Subramonian, R., von Eicken, T., LogP: Towards a realistic model of parallel computation, In Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993."},{"key":"6_CR55","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(95)00174-3","volume":"57","author":"M Drozdowski","year":"1996","unstructured":"Drozdowski, M., Real-time scheduling of linear speedup parallel tasks, Information Processing Letters 57, 1996, 35\u201340.","journal-title":"Processing Letters"},{"key":"6_CR56","volume-title":"Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems","author":"M Drozdowski","year":"1997","unstructured":"Drozdowski, M., Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems, Poznan University of Technology Press, Poznan, 1997."},{"key":"6_CR57","volume-title":"Memorial University of Newfoundland","author":"M Drozdowski","year":"1995","unstructured":"Drozdowski, M., Kubiak, W., Scheduling parallel tasks with sequential heads and tails, Working paper, Memorial University of Newfoundland, St. John\u2019s, 1995."},{"key":"6_CR58","volume-title":"Poznan University of Technology","author":"D Drzewiecki","year":"1997","unstructured":"Drzewiecki, D., Drozdowski, M., Rozdzial obci4ien w rozproszonym systemie komputerowym metod4 zadania jednorodnego, Technical Report RB-008\/97, Institute of Computing Science, Poznan University of Technology, 1997."},{"key":"6_CR59","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J Du","year":"1989","unstructured":"Du, J., Leung, J.Y-T., Complexity of scheduling parallel tasks systems, SIAM J. on Discrete Mathematics 2, 1989, 473\u2013487.","journal-title":"Siam J. on Discrete Mathematics"},{"key":"6_CR60","volume-title":"Anchorage","author":"K Ecker","year":"1994","unstructured":"Ecker, K., Hammer, D., Integrated scheduling for CIM systems, Proc. TIMS XXXII, Anchorage, 1994."},{"key":"6_CR61","volume-title":"Newport Beach","author":"KH Ecker","year":"1993","unstructured":"Ecker, K.H., Hirschberg, R., Scheduling communication demands in networks, Proc. of the Workshop on Parallel and Distributed Real-Time Systems, Newport Beach, 1993."},{"key":"6_CR62","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S., Two-processor scheduling with starttimes and deadlines, SIAM J. on Computing 6, 1977, 416\u2013426.","journal-title":"Siam J. on Computing"},{"key":"6_CR63","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"6_CR64","volume-title":"Rutgers University","author":"A Gerasoulis","year":"1992","unstructured":"Gerasoulis, A., Yang, T., On the granularity and clustering of directed acyclic task graphs, Report TR-153, Dept. Comput. Sci., Rutgers University, 1992."},{"key":"6_CR65","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/jpdc.1994.1141","volume":"23","author":"D Ghose","year":"1994","unstructured":"Ghose, D., Mani, V., Distributed computation with communication delays: Asymptotic performance analysis, Journal of Parallel and Distributed Computing 23, 1994, 293\u2013305.","journal-title":"Distributed Computing"},{"key":"6_CR66","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M., Tabu Search, Kluwer Academic Pubishers, London, 1997."},{"key":"6_CR67","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0166-218X(94)00160-F","volume":"61","author":"M Goemans","year":"1995","unstructured":"Goemans, M., An approximation algorithm for scheduling on three dedicated processors, Discrete Applied Mathematics 61, 1995, 49\u201360.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR68","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E., Genetic Algorithms in Search, Optimization and Ma- chine Learning, Addison-Wesley, Reading, Mass., 1989."},{"key":"6_CR69","volume-title":"Distributed Operating Systems","author":"A Goscinski","year":"1991","unstructured":"Goscinski, A., Distributed Operating Systems, Addison-Wesley, Sydney, 1991."},{"key":"6_CR70","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L., Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45, 1966, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"6_CR71","first-page":"263","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L., Bounds on multiprocessing timing anomalies, SIAM J. on Applied Mathematics 17, 1969, 263\u2013269.","journal-title":"Siam J. on Applied Mathematics"},{"key":"6_CR72","volume-title":"Concrete Mathematics. A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O., Concrete Mathematics. A Foundation for Computer Science, Addison-Wesley, Reading, Mass., 1994."},{"key":"6_CR73","first-page":"497","volume-title":"Experimental evaluation of load balancing techniques for hypercube, D.J.Evans, G.R.Joubert, H.Liddell, (eds), Parallel Computing 91","author":"AY Grama","year":"1992","unstructured":"Grama, A.Y., Kumar, V., Rao, V.N., Experimental evaluation of load balancing techniques for hypercube, D.J.Evans, G.R.Joubert, H.Liddell, (eds), Parallel Computing \u201881, Elsevier Science, New York, 1992, 497\u2013514."},{"key":"6_CR74","volume-title":"Technical Report","author":"C Hanen","year":"1994","unstructured":"Hanen, C., Munier, A., Performance of Coffman-Graham schedules in presence of unit communication delays, Technical Report 12, Laboratoire LITP, Paris, 1994."},{"key":"6_CR75","volume-title":"Proc. of IEEE Symposium on Emerging Technologies and Factory Automation, Paris","author":"C Hanen","year":"1995","unstructured":"Hanen, C., Munier, A., An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, in Proc. of IEEE Symposium on Emerging Technologies and Factory Automation, Paris, 1995."},{"key":"6_CR76","first-page":"111","volume":"1","author":"A Hertz","year":"1990","unstructured":"Hertz, A., de Werra, D., The tabu search metaheuristic: How we use it, Annals of Mathematics and Artificial Intelligence 1, 1990, 111\u2013121.","journal-title":"Artificial Intelligence"},{"key":"6_CR77","volume-title":"Preemptive scheduling on a hypercube, Report 8963\/A Econometric Institute","author":"CP Hoesel","year":"1989","unstructured":"van Hoesel, C.P.M., Preemptive scheduling on a hypercube, Report 8963\/A Econometric Institute, Erasmus University, Rotterdam, 1989."},{"key":"6_CR78","volume-title":"Amsterdam","author":"JA Hoogeveen","year":"1992","unstructured":"Hoogeveen, J.A., Lenstra, J.K., Veltman, B., Three, four, five, six or the complexity of scheduling with communication delays, Report BS-R9229, CWI, Amsterdam, 1992."},{"key":"6_CR79","first-page":"259","volume":"55","author":"JA Hoogeven","year":"1994","unstructured":"Hoogeven, J.A., van de Velde, S.L., Veltman, B., Complexity of scheduling multiprocessor tasks with prespecified processor allocation, Discrete Applied Mathematics 55, 1994, 259\u2013272.","journal-title":"Mathematics"},{"key":"6_CR80","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"96","author":"TC Hu","year":"1961","unstructured":"Hu, T.C., Parallel sequencing and assembly line problems, Operations Research 96, 1961, 841\u2013848.","journal-title":"Operations Research"},{"key":"6_CR81","volume-title":"Advanced Computer Architecture: Parallelism, Scalability, Programmability","author":"K Hwang","year":"1993","unstructured":"Hwang, K., Advanced Computer Architecture: Parallelism, Scalability, Programmability, MCGraw-Hill, New York, 1993."},{"key":"6_CR82","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"JJ Hwang","year":"1989","unstructured":"Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y., Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. on Computing 18, 1989, 244\u2013257.","journal-title":"Siam J. on Computing"},{"key":"6_CR83","first-page":"165","volume":"3","author":"A Jakoby","year":"1992","unstructured":"Jakoby, A., Reischuk, R., The complexity of scheduling problems with communication delays for trees, Proc. Scandinavian Workshop on Algorithmic Theory 3, 1992, 165\u2013177.","journal-title":"Proc. Scandinavian Workshop on Algorithmic Theory"},{"key":"6_CR84","doi-asserted-by":"crossref","unstructured":"Jung, H., Kirousis, L., Spirakis, P., Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, Proc. ACM Symp. Parallel Algorithms and Architectures, 1989, 254\u2013264.","DOI":"10.1145\/72935.72962"},{"key":"6_CR85","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N., A new polynomial-time algorithm for linear programming, Combinatorica 4, 1984, 373\u2013395.","journal-title":"Combinatorica"},{"key":"6_CR86","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M., Reducibility among combinatorial problems, R.E.Miller, J.W.Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, 85\u2013104."},{"key":"6_CR87","first-page":"1093","volume":"244","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G., A polynomial algorithm for linear programming (in Russian), Dokl. Akad. Nauk SSSR 244, 1979, 1093\u20131096.","journal-title":"Dokl. Akad. Nauk Sssr"},{"key":"6_CR88","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., Optimization by simulated annealing, Science 220, 1983, 671\u2013680.","journal-title":"Science"},{"key":"6_CR89","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"C-34","author":"H. Krawczyk","year":"1985","unstructured":"Krawczyk, H., Kubale, M., An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers C-34, 1985, 869\u2013872.","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR90","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90176-1","volume":"24","author":"M Kubale","year":"1987","unstructured":"Kubale, M., The complexity of scheduling independent two-processor tasks on dedicated processors, Information Processing Letters 24, 1987, 141\u2013147.","journal-title":"Information Processing Letters"},{"key":"6_CR91","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(96)00131-2","volume":"94","author":"M Kubale","year":"1996","unstructured":"Kubale, M., Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors, European Journal of Operational Research 94, 1996, 242\u2013251.","journal-title":"European Journal of Operational Research"},{"key":"6_CR92","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/32.83908","volume":"17","author":"T Kunz","year":"1991","unstructured":"Kunz, T., The influence of different workload descriptions on a heuristic load balancing scheme, IEEE Transactions on Software Engineering, 17, 1991, 725\u2013730.","journal-title":"Ieee Transactions on Software Engineering"},{"key":"6_CR93","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"PJ Laarhoven","year":"1987","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L., Simulated Annealing: Theory and Applications, Reider, Dordrecht, 1987."},{"key":"6_CR94","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0743-7315(90)90006-B","volume":"10","author":"T Lang","year":"1990","unstructured":"Lang, T., Kurisaki, L., Nonuniform traffic spots (NUTS) in multistage interconnection networks, J. Parallel and Distributed Computing 10, 1990, 55\u201367.","journal-title":"Distributed Computing"},{"key":"6_CR95","volume-title":"Scheduling trees on multiprocessors with unit communication delays, Proc. Workshop on Models and Algorithms for Planning and Scheduling Problems","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Scheduling trees on multiprocessors with unit communication delays, Proc. Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Italy, 1993."},{"key":"6_CR96","volume-title":"Sequencing and scheduling: Algorithms and complexity, Graves, S.C., Rinnoy Kan, A.H.G., Zipkin, P.H., (eds.), Handbook in Oprations Research and Management Science, Vol. 4: Logistics of Production and Inventory","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B., Sequencing and scheduling: Algorithms and complexity, Graves, S.C., Rinnoy Kan, A.H.G., Zipkin, P.H., (eds.), Handbook in Oprations Research and Management Science, Vol. 4: Logistics of Production and Inventory, Elsevier, Amsterdam, 1993."},{"key":"6_CR97","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E., Branch and bound methods: A survey, Operations Research 14, 1966, 699\u2013719.","journal-title":"Operations Research"},{"key":"6_CR98","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1996.0007","volume":"20","author":"JK Lenstra","year":"1996","unstructured":"Lenstra, J.K., Veldhorst, M., Veltman, B., The complexity of scheduling trees with communication delays, Journal of Algorithms 20, 1996, 157\u2013173.","journal-title":"Journal of Algorithms"},{"key":"6_CR99","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/BF02577870","volume":"22","author":"J Liu","year":"1994","unstructured":"Liu, J., Saletore, V.A., Lewis, T.G., Safe Self-Scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors, International Journal of Parallel Programming 22, 1994, 589\u2013616.","journal-title":"International Journal of Parallel Programming"},{"key":"6_CR100","doi-asserted-by":"crossref","unstructured":"Lloyd, E.L., Concurrent task systems, Operations Research 29, 189\u2013201.","DOI":"10.1287\/opre.29.1.189"},{"key":"6_CR101","doi-asserted-by":"crossref","unstructured":"Luling, R., Monien, B., Load balancing for distributed branch & bound, Proc. of 6th International Parallel Processing Symposium, 1992, 543\u2013548.","DOI":"10.1109\/IPPS.1992.222970"},{"key":"6_CR102","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jpdc.1993.1043","volume":"18","author":"E Ma","year":"1993","unstructured":"Ma, E., Tao, L., Embeddings among meshes and tori, J. Parallel and Distributed Computing 18, 1993, 44\u201355.","journal-title":"J. Parallel and Distributed Computing"},{"key":"6_CR103","first-page":"471","volume":"30","author":"V Mani","year":"1994","unstructured":"Mani, V., Ghose, D., Distributed computation in linear networks: Closed-form solutions. IEEE Transactions on Aerospace and Electronic Systems 30, 1994, 471\u2013483.","journal-title":"Electronic Systems"},{"key":"6_CR104","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/71.273046","volume":"5","author":"EP Markatos","year":"1994","unstructured":"Markatos, E.P., LeBlanc, T.J., Using processor affinity in loop scheduling on shared-memory multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 5, 1994, 379\u2013400.","journal-title":"Distributed Systems"},{"key":"6_CR105","first-page":"1","volume":"12","author":"R Mcnaughton","year":"1959","unstructured":"McNaughton, R., Scheduling with deadlines and loss functions, Management Science 12, 1959, 1\u201312.","journal-title":"Science"},{"key":"6_CR106","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"M Metropolis","year":"1953","unstructured":"Metropolis, M., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E., Equation of state calculations by fast computing machines, J. Chemical Physics 21, 1953, 1087\u20131092.","journal-title":"J. Chemical Physics"},{"key":"6_CR107","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1992."},{"key":"6_CR108","unstructured":"Moh89] M\u00f6hring, R.H., Computationally tractable classes of ordered sets, I."},{"key":"6_CR109","first-page":"105","volume-title":"Algorithms","author":"Rival","year":"1989","unstructured":"Rival (ed.), Algorithms and Order, Kluwer, Dordrecht, 1989, 105\u2013193."},{"key":"6_CR110","volume-title":"Approximation algorithms for scheduling trees with general communication delays, Technical report","author":"A Munier","year":"1996","unstructured":"Munier, A., Approximation algorithms for scheduling trees with general communication delays, Technical report, Laboratoire LITP, Paris, 1996."},{"key":"6_CR111","volume-title":"Technical Report","author":"A Munier","year":"1995","unstructured":"Munier, A., Hanen, C., An approximation algorithm for scheduling unitary tasks on m processors with unitary communication delays, Technical Report 12, Laboratoire LITP, Paris, 1995."},{"key":"6_CR112","doi-asserted-by":"crossref","unstructured":"Munier, A., Hanen, C., Using duplication for scheduling unitary tasks on m processors with communication delays, Theoretical Computer Science,1997, to appear.","DOI":"10.1016\/S0304-3975(97)88194-7"},{"key":"6_CR113","doi-asserted-by":"crossref","unstructured":"Munier, A., K\u00f6nig, J.-C., A heuristic for a scheduling problem with communication delays, Operations Research,1996, to appear.","DOI":"10.1287\/opre.45.1.145"},{"key":"6_CR114","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/T-C.1969.222573","volume":"18","author":"RR Muntz","year":"1969","unstructured":"Muntz, R.R., Coffman Jr., E.G., Optimal preemptive scheduling on two-processor systems, IEEE Transactions on Computers 18, 1969, 1014\u20131020.","journal-title":"Ieee Transactions on Computers"},{"key":"6_CR115","doi-asserted-by":"crossref","unstructured":"Muntz, R.R., Coffman Jr., E.G., Preemptive scheduling of real-time tasks on multiprocessor systems, Journal of the ACM 17 1970, 324338.","DOI":"10.1145\/321574.321586"},{"key":"6_CR116","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/2.191995","volume":"26","author":"LM Ni","year":"1993","unstructured":"Ni, L.M., McKinley, P.K., A survey of warmhole routing techniques in direct networks, Computer 26, 1993, 62\u201376.","journal-title":"Computer"},{"key":"6_CR117","volume-title":"Roma","author":"P Dell\u2019Olmo","year":"1995","unstructured":"Dell\u2019Olmo, P., Speranza, M.G., Tuza, Z.S., Easy and hard cases of a scheduling problem on 3 dedicated processors, Report, IASI, Roma, 1995."},{"key":"6_CR118","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"CH Papadimitriou","year":"1990","unstructured":"Papadimitriou, C.H., Yannakakis, M., Towards an architectureindependent analysis of parallel algorithms, SIAM J. on Computing 19, 1990, 322\u2013328.","journal-title":"Siam J. on Computing"},{"key":"6_CR119","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/71.485507","volume":"7","author":"JL Park","year":"1996","unstructured":"Park, J.L., Choi, H., Circuit-switched broadcasting in torus mesh networks, IEEE Transactions on Parallel and Distributed Systems 7, 1996, 184\u2013190.","journal-title":"Distributed Systems"},{"key":"6_CR120","unstructured":"Picouleau, C., Two new NP-complete scheduling problems with communication delays and unlimited number of processors, Report RP91\/24, MASI, Institut Blaise Pascal, Universite Paris VI, 1991, to appear in Discrete Applied Mathematics."},{"key":"6_CR121","unstructured":"Picouleau, C., Etude de probl\u00e8mes d\u2019optimization dans les syst\u00e8mes distribut\u00e9s, Ph.D. Thesis, Universit\u00e9 Paris V I, 1992."},{"key":"6_CR122","volume-title":"Scheduling: Theory, Algoritms, and Systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo, M., Scheduling: Theory, Algoritms, and Systems, Prentice Hall, Enlewood Cliffs, N.J., 1995."},{"key":"6_CR123","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","volume":"18","author":"VJ Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.J., UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics 18, 1987, 55\u201371.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR124","first-page":"1216","volume":"29","author":"TG Robertazzi","year":"1993","unstructured":"Robertazzi, T.G., Processor equivalence for a linear daisy chain of load sharing processors, IEEE Trans. on Aerospace and Electronic Systems 29, 1993, 1216\u20131221.","journal-title":"Electronic Systems"},{"key":"6_CR125","volume-title":"Discrete Mathematics","author":"KA Ross","year":"1992","unstructured":"Ross, K.A., Wright, C.R.B., Discrete Mathematics, Prentice-Hall Inc., Enlewood Cliffs, N.J., 1992."},{"key":"6_CR126","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0020-0190(91)90201-R","volume":"40","author":"X Shen","year":"1991","unstructured":"Shen, X., Reingold, E.M., Scheduling on a hypercube, Information Processing Letters 40, 1991, 323\u2013328.","journal-title":"Information Processing Letters"},{"key":"6_CR127","volume-title":"Addison-wesley","author":"A Silberschatz","year":"1991","unstructured":"Silberschatz, A., Peterson, J.L., Galvin, P.B., Operating Systems Concepts, Addison-Wesley, 1991."},{"key":"6_CR128","first-page":"835","volume-title":"Proc. of the 1993 Conference on Information Sciences and Systems","author":"J Sohn","year":"1993","unstructured":"Sohn, J., Robertazzi, T.G., Optimal load sharing for a divisible job on a bus network, In Proc. of the 1993 Conference on Information Sciences and Systems, The John Hopkins University, Baltimore, MD, 1993, 835\u2013840."},{"key":"6_CR129","volume-title":"Technical Report","author":"J Sohn","year":"1994","unstructured":"Sohn, J., Robertazzi, T.G., A muli-job load sharing strategy for divisible jobs on bus networks, Technical Report 697, Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, New York, 1994."},{"key":"6_CR130","volume-title":"Technical Report","author":"J Sohn","year":"1995","unstructured":"Sohn, J., Robertazzi, T.G., An optimum load sharing strategy for divisible jobs with time-varying processor speed and channel speed, Technical Report 706, Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, New York, 1995."},{"key":"6_CR131","volume-title":"Technical Report","author":"J Sohn","year":"1995","unstructured":"Sohn, J., Robertazzi, T.G., Luryi, S., Optimizing computing costs using divisible load analysis, Technical Report 719, Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, New York, 1995."},{"key":"6_CR132","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/0743-7315(89)90035-X","volume":"7","author":"TH Szymanski","year":"1989","unstructured":"Szymanski, T.H., Hamacher, V.C., On the universality of multipath multistage interconnection networks, J. Parallel and Distributed Computing 7, 1989, 541\u2013569.","journal-title":"Distributed Computing"},{"key":"6_CR133","volume-title":"Distributed Operating Systems","author":"AS Tanenbaum","year":"1995","unstructured":"Tanenbaum, A.S., Distributed Operating Systems, Prentice-Hall, Enlewood Cliffs, N.J., 1995."},{"key":"6_CR134","volume-title":"New York","author":"JD Ullman","year":"1976","unstructured":"Ullman, J.D., Complexity of sequencing problems, Coffman Jr., E.G., (ed.), Scheduling in Computer and Job Shop Systems, New York, 1976."},{"key":"6_CR135","doi-asserted-by":"crossref","unstructured":"Varvarigou, T., Roychowdhury, V.P., Kailath, T., Scheduling in and out forests in the presence of communication delays, Proc. Intern. Parallel Processing Symposium, Newport Beach, 1993, 222\u2013229.","DOI":"10.1109\/IPPS.1993.262886"},{"key":"6_CR136","volume-title":"Multiprocessor Scheduling with Communication Delays, Ph.D","author":"B Veltman","year":"1993","unstructured":"Veltman, B., Multiprocessor Scheduling with Communication Delays, Ph.D. Thesis, CWI-Amsterdam, 1993."},{"key":"6_CR137","doi-asserted-by":"crossref","unstructured":"Verhoosel, J.P.C., Welch, L.R., Hammer, D.K., Stayenko, A.D., A model for scheduling of object-based, distributed real-time systems, J. Real-Time Systems 8, 1995.","DOI":"10.1007\/BF01893144"},{"key":"6_CR138","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"TA Welch","year":"1984","unstructured":"Welch, T.A., A technique for high-performace data compression, IEEE Computer 17, 1984, 8\u201319.","journal-title":"Ieee Computer"},{"key":"6_CR139","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/355744.355755","volume":"3","author":"J Wgglarz","year":"1977","unstructured":"Wgglarz, J., Blaiewicz, J., Cellary, W., Slowinski, R., An automatic revised simplex method for constrained resource network scheduling, ACM Transactions on Mathematical Software 3, 1977, 295\u2013300.","journal-title":"Acm Transactions on Mathematical Software"},{"key":"6_CR140","first-page":"457","volume":"3","author":"RD Williams","year":"1991","unstructured":"Williams, R.D., Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice and Experience 3, 1991, 457\u2013481.","journal-title":"Experience"},{"key":"6_CR141","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1993.1039","volume":"18","author":"J Xu","year":"1993","unstructured":"Xu, J., Hwang, K., Heuristic methods for dynamic load balancing in a message-passing multicomputer, Journal of Parallel and Distributed Computing 18, 1993, 1\u201313.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6_CR142","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A., Compression of individual sequences via variablerate coding, IEEE Transactions on Information Theory 24, 1978, 530\u2013536.","journal-title":"Ieee Transactions on Information Theory"}],"container-title":["Handbook on Parallel and Distributed Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-04303-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T19:12:47Z","timestamp":1745953967000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-662-04303-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783642085710","9783662043035"],"references-count":142,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-662-04303-5_6","relation":{},"subject":[],"published":{"date-parts":[[2000]]}}}