{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T14:10:19Z","timestamp":1723126219892},"reference-count":0,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"name":"Texas Advanced Technology Program","award":["TATP-003594031"],"award-info":[{"award-number":["TATP-003594031"]}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["VLSI Design"],"published-print":{"date-parts":[[1999,1]]},"abstract":"<jats:p>In an optimistic parallel simulation, logical processes (Ips) proceed with their\ncomputation without any constraints. However, if the computing requirements of\ndifferent lps are not balanced or if the processors are not homogeneous, some lps may\nlag behind in simulation time while others surge forward. In other words, if the\nsimulation clocks of different lps are not progressing at the same rate, cascading\nrollbacks may occur nullifying the potential benefit of an optimistic parallel discrete\nevent simulation (PDES). Hence it is necessary to balance the computational load on\ndifferent lps in such a way that their local simulation clocks advance almost at the same\nrate. In this paper, we propose two algorithms for dynamic load balancing which reduce\nthe number of rollbacks in an optimistic PDES system. Our first algorithm is based on\nthe load transfer mechanism between lps; while the second algorithm, based on the\nprinciple of evolutionary strategy, migrates logical processes between several pairs of\nphysical processors. We have implemented both of these algorithms on a cluster of\nheterogeneous workstations and studied their performance. The experimental results\nshow that the algorithm based on the load transfer is effective when the grain size is\ngreater than 10 milliseconds. The algorithm based on the process migration yields good\nperformance only for grain sizes of 20 milliseconds or larger. In both of these cases the\nspeed up ranges mostly between and 2 using four processors.<\/jats:p>","DOI":"10.1155\/1999\/64750","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T12:58:21Z","timestamp":1190120301000},"page":"271-290","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Design and Implementation of DynamicLoad Balancing Algorithms for Rollback Reductionin Optimistic PDES"],"prefix":"10.1155","volume":"9","author":[{"given":"Falguni","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[1999,1]]},"container-title":["VLSI Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/1999\/064750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/1999\/64750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T13:54:47Z","timestamp":1723125287000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/1999\/64750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["10.1155\/1999\/64750"],"URL":"https:\/\/doi.org\/10.1155\/1999\/64750","archive":["Portico"],"relation":{},"ISSN":["1065-514X","1563-5171"],"issn-type":[{"type":"print","value":"1065-514X"},{"type":"electronic","value":"1563-5171"}],"subject":[],"published":{"date-parts":[[1999,1]]},"assertion":[{"value":"1998-05-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"1999-01-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}