Scheduled hot-potato routing.
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Grzegorz Chmaj, Krzysztof Walkowiak, Michał Tarnawski, Michał Kucharzak (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational...
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
Journal of Graph Algorithms and Applications
Similarity:
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Konstantinos Paparrizos (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Petrica Pop, Corina Pop Sitar (2011)
The Yugoslav Journal of Operations Research
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Hadda Cherroun, Alain Darte, Paul Feautrier (2007)
RAIRO - Operations Research
Similarity:
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...