{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T23:34:21Z","timestamp":1718148861012},"reference-count":9,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T00:00:00Z","timestamp":1174521600000},"content-version":"vor","delay-in-days":6289,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1990,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To use multiprocessor systems efficiently, several load balancing algorithms have been adopted widely. However, most of the algorithms proposed so far can be applied to FCFS systems, and only a few can be applied to time\u2010sharing systems in wide use today. This paper proposes a load balancing algorithm designed to reduce the average response time of processes, introducing a load measure which takes into account the distribution of the work demand of each kind of process. This algorithm can be applied to a multiprocessor system with round\u2010robin scheduling discipline. This algorithm also seems easy to implement on actual systems because load balancing is made by assigning new processes to the lightest loaded processor rather than migrating running processes. According to the simulation experiment, the algorithm proposed here improves the average response time compared with that of the \u201cJoin the Shortest Queue\u201d algorithm over all situations investigated.<\/jats:p>","DOI":"10.1002\/scj.4690210801","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T19:33:29Z","timestamp":1183836809000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["A load balancing algorithm on multiprocessor time\u2010sharing systems"],"prefix":"10.1002","volume":"21","author":[{"given":"Nariyoshi Yamai","family":"Member","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Shimojo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideo Miyahara","family":"Members","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,22]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676564"},{"key":"e_1_2_1_3_2","first-page":"216","volume-title":"Dynamic load balancing algorithms in homogeneous distributed systems","author":"Hsu C. H.","year":"1986"},{"key":"e_1_2_1_4_2","first-page":"314","volume-title":"A stable distributed scheduling algorithm","author":"Bryant R. M.","year":"1981"},{"issue":"2","key":"e_1_2_1_5_2","first-page":"445","article-title":"Optimal static load balancing in distributed computer systems","volume":"32","author":"Tantawi A. N.","year":"1985","journal-title":"Journal of A.C.M."},{"key":"e_1_2_1_6_2","first-page":"505","volume-title":"Process assignment on distributed system with communication contentions. Computer Networking and Performance Evaluation","author":"Shimojo S.","year":"1986"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/6041.6074"},{"key":"e_1_2_1_8_2","volume-title":"Probability and Statistics with Reliability, Queueing, and Computer Science Applications","author":"Trivedi K. S.","year":"1982"},{"key":"e_1_2_1_9_2","volume-title":"Queueing Systems, 2: Computer Applications","author":"Kleinrock L.","year":"1976"},{"key":"e_1_2_1_10_2","first-page":"681","volume-title":"A process dispatching algorithm on multiprocessor time\u2010sharing systems","author":"Yamai N.","year":"1987"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690210801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690210801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T20:35:42Z","timestamp":1698006942000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690210801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1002\/scj.4690210801"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690210801","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}