Optimal scheduling for disconnected cooperation

No abstract is available for this paper.

• Publication year

  2001

• Venue

  ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

• Publication date

  2001-08-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/383962.384048
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• 2020 Index IEEE Transactions on Mobile Computing Vol. 19

  2021cited by this paper
• Graph Theory

  2016cited by this paper
• Cooperative computing with fragmentable and mergeable groups

  2003cited by this paper
• Performing tasks on synchronous restartable message-passing processors

  2001cited by this paper
• Distributed Cooperation During the Absence of Communication

  2000cited by this paper
• Distributed cooperation in the absence of communication (brief announcement)

  2000cited by this paper
• Optimal, distributed decision-making: the case of no communication

  1999cited by this paper
• Performing Tasks on Restartable Message-Passing Processors

  1997cited by this paper
• Fault-Tolerant Parallel Computation

  1997cited by this paper
• Time-optimal message-efficient work performance in the presence of faults

  1994cited by this paper
• Performing work efficiently in the presence of faults

  1992cited by this paper
• On the value of information in distributed decision-making (extended abstract)

  1991cited by this paper
• A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

  1971cited by this paper

• Practical Fault-Tolerance for Mobile Agents

  2011cites this paper
• Dynamic load balancing with group communication

  2006cites this paper
• Latin squares with bounded size of row prefix intersections

  2006cites this paper
• Distributed scheduling for disconnected cooperation

  2005cites this paper
• System support for pervasive applications

  2004cites this paper
• Challenges in Evaluating Distributed Algorithms

  2003cites this paper
• distributed cooperation and adversity: complexity trade-offs

  2003cites this paper
• Robust distributed cooperation in the presence of quantified adversity

  2003influential citation
• Group membership and wide-area master-worker computations

  2003cites this paper