Transport-Problem-Based Algorithm for Dynamic Load Balancing in Distributed Logic Simulation
| dc.contributor.author | Ladizhensky, Yury V. | |
| dc.contributor.author | Kourktchi, Viatcheslav A. | |
| dc.contributor.editor | Mayr, Heinrich C. | |
| dc.contributor.editor | Karagiannis, Dimitris | |
| dc.date.accessioned | 2019-05-15T09:28:50Z | |
| dc.date.available | 2019-05-15T09:28:50Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Advantages and disadvantages of a dynamic load balancing algorithm which minimizes Euclidean norm of data migration are discussed. A new effective algorithm for a dynamic load balancing problem is suggested. The algorithm is based on a transport problem solving and searching for shortest ways in a graph. Experimental results for the algorithm are provided. | en |
| dc.identifier.isbn | 978-3-88579-2017 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/22669 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | Information systems technology and its applications – 6th international conference – ISTA 2007 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-107 | |
| dc.title | Transport-Problem-Based Algorithm for Dynamic Load Balancing in Distributed Logic Simulation | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 127 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 117 | |
| gi.conference.date | May 23-25, 2007 | |
| gi.conference.location | Kharkiv, Ukraine | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1