Sciweavers

5334 search results - page 372 / 1067
» Communicating quantum processes
Sort
View
ICPADS
1998
IEEE
15 years 11 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
TABLEAUX
1997
Springer
15 years 11 months ago
Tableau Methods for PA-Processes
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
Richard Mayr
PODC
1992
ACM
15 years 10 months ago
The Weakest Failure Detector for Solving Consensus
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toue...
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
15 years 10 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
ICPP
1989
IEEE
15 years 10 months ago
Exploring "Multiple Worlds" in Parallel
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...
Jonathan M. Smith, Gerald Q. Maguire Jr.