{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T07:11:43Z","timestamp":1698045103108},"reference-count":7,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":6653,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1989,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents an approximate solution for the process assignment problem with communication contentions in the distributed system. It is assumed that several processes perform a job through mutual communication, and that the process knows the interprocess communication probability as well as its mean interval. A method is shown in this paper whereby the distributed system is modeled as a queueing network model, and the mean job execution time is determined analytically. Then assuming that the job is composed of several such processes, an approximate solution is shown based on the branch\u2010and\u2010bound method to derive the assignment to processors minimizing the mean job execution time. Several methods are introduced to reduce the search time. Finally, based on numerical examples, it is demonstrated that the proposed method is sufficiently useful with a small error compared with the exact solution.<\/jats:p>","DOI":"10.1002\/scj.4690200609","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:19:09Z","timestamp":1195042749000},"page":"80-90","source":"Crossref","is-referenced-by-count":0,"title":["Process assignment in distributed systems"],"prefix":"10.1002","volume":"20","author":[{"given":"Shinji","family":"Shimojo","sequence":"first","affiliation":[]},{"given":"Hideo","family":"Miyahara","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653419"},{"issue":"3","key":"e_1_2_1_3_2","article-title":"A graph matching approach to optimal task assignment in distributed computing systems using a minmax criterion","volume":"34","author":"Shen C. C.","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"e_1_2_1_4_2","unstructured":"S.Shimojo H.Miyahara andK.Taka\u2010shima.Process assignment on distributed system with communication contentions. Proc. of Inter. Seminar of Comput. Network and Perf. Eval. pp.11\u201315(Sept.1985)."},{"issue":"5","key":"e_1_2_1_5_2","article-title":"Process assignment problem in multiprocessor including communication contention","volume":"68","author":"Shimojo S.","year":"1985","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676125"},{"key":"e_1_2_1_7_2","unstructured":"Ibaraki.Optimization of Combinational Problem. Sangyo Tosho Co. (1983)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4566.001.0001","volume-title":"Metamodeling","author":"Agrawal S. C.","year":"1985"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690200609","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690200609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T11:51:56Z","timestamp":1697975516000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690200609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["10.1002\/scj.4690200609"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690200609","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}