{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:56:38Z","timestamp":1752360998189},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1109\/tpds.2003.1167369","type":"journal-article","created":{"date-parts":[[2003,3,7]],"date-time":"2003-03-07T18:58:16Z","timestamp":1047063496000},"page":"39-50","source":"Crossref","is-referenced-by-count":27,"title":["Opportunity cost algorithms for reduction of I\/O and interprocess communication overhead in a computing cluster"],"prefix":"10.1109","volume":"14","author":[{"given":"A.","family":"Keren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Barak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60321-2_10"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(94)00059-J"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/191525.191541"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1377"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1997.604538"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1994.344308"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1996.537155"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0050"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref34","author":"pacheco","year":"1996","journal-title":"Parallel Programming with MPI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0141-9331(98)00077-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(97)00037-X"},{"key":"ref12","first-page":"95","article-title":"Scalable Cluster Computing with MOSIX for LINUX","author":"barak","year":"1999","journal-title":"Proc Fifth Ann Linux Expo"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/2.362631"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240477"},{"key":"ref15","first-page":"159","article-title":"Preemptive Scheduling of Parallel Jobs on Multiprocessors","author":"deng","year":"1996","journal-title":"Proc Seventh Ann ACM-SIAM Symp Discrete Algorithms (SODA '96)"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","article-title":"On-Line Routing","author":"fiat","year":"1998","journal-title":"Online Algorithms The State of Art"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","author":"fiat","year":"1998","journal-title":"Online Algorithms The State of Art"},{"key":"ref18","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","author":"geist","year":"1994","journal-title":"PVM Parallel Virtual Machine A Users' Guide and Tutorial for Networked Parallel Computing"},{"key":"ref28","article-title":"Inter Process Communication Optimization in a Scalable Computing Cluster","author":"la'adan","year":"1999","journal-title":"Ann Rev of Scalable Computing"},{"key":"ref4","first-page":"399","article-title":"Hardness of Approximations","author":"arora","year":"1997","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref3","first-page":"257","article-title":"Automatic Methods for Hiding Latency in High Bandwidth Networks","author":"andrews","year":"1996","journal-title":"Proc 28th ACM Symp Theory Of Computing (STOC'96)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/49.414634"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253322"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029569","article-title":"On-Line Load Balancing","author":"azar","year":"1998","journal-title":"Online Algorithms The State of Art"},{"key":"ref7","first-page":"321","article-title":"Competitive Routing of Virtual Circuits with Unknown Duration","author":"awerbuch","year":"1994","journal-title":"Proc Fifth ACM-SIAM Symp Discrete Algorithms (SODA '94)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/40.342018"},{"key":"ref9","article-title":"MOSIXScalable Cluster Computing for Unix","author":"barak","year":"2002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877834"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(19980725)28:9<929::AID-SPE183>3.0.CO;2-C"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/263326.263344"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref24","author":"corp","year":"2001","journal-title":"LoadLevelerEfficient Job Scheduling and Management"},{"key":"ref23","article-title":"A Multilevel Algorithm for Partitioning Graphs","author":"hendrickson","year":"1995","journal-title":"Proc Supercomputing '95"},{"key":"ref26","article-title":"On-Line Assignment of Processes in a Scalable Computing Cluster","author":"keren","year":"1998"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","article-title":"Multilevel k-Way Partitioning Scheme for Irregular Graphs","volume":"48","author":"karypis","year":"1998","journal-title":"J Parallel and Distributed Computing"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/71\/26325\/01167369.pdf?arnumber=1167369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:55Z","timestamp":1642005115000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1167369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"URL":"https:\/\/doi.org\/10.1109\/tpds.2003.1167369","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}