Eli Gafni
ABSTRACT
No abstract available.
- 1.M. Herlihy and N. Shavit. The Asynchronous Computability Theorem for t-resilient Tasks. In $TOC 1995. Google Scholar
Digital Library
- 2.M. Herlihy. Impossibility Results for Asynchronous PRAM. In $PAA 1991. Google ScholarDigital Library
- 3.T. Ch~ndra, V, Hadzilacos, P. ~Iayanti, and S. Toue~. Wait-Freedom vs. t-resiliency and the Robustness of the Wait-Free Hierarchies. In PODC 199_4. Google ScholarDigital Library
- 4.E. Gafni. Computability Results by Algorithmic Reasoning. Preconference Talk PODC 1995.Google Scholar
- 5.E. Borowsky. Capturing the Power of Resiliency and Set- Consensus in Distributed Systems. Ph.D. Thesis, U CLA, Oct. 1995. Google ScholarDigital Library
Index Terms
- Simulation as an iterated task
Recommendations
An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems
This paper investigates the problem of allocating parallel application tasks to processors in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation for more than ...
Multistart Iterated Tabu Search for Bandwidth Coloring Problem
This paper presents a Multistart Iterated Tabu Search (MITS) algorithm for solving Bandwidth Coloring Problem (BCP) and Bandwidth MultiColoring Problem (BMCP). The proposed MITS algorithm exhibits several distinguishing features, such as integrating an ...
Backtracking based iterated tabu search for equitable coloring
An equitable k-coloring of an undirected graph G = ( V , E ) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP),...
Comments