Sciweavers

181 search results - page 8 / 37
» A Distributed Pi-Calculus with Local Areas of Communication
Sort
View
ICPP
2000
IEEE
15 years 1 months ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster
COMSWARE
2006
IEEE
15 years 1 months ago
M2MC: Middleware for many to many communication over broadcast networks
M2MC is a new distributed computing middleware designed to support collaborative applications running on devices connected by broadcast networks. Examples of such networks are wire...
Chaitanya Krishna Bhavanasi, Sridhar Iyer
SIGMETRICS
1998
ACM
14 years 9 months ago
Scheduling with Implicit Information in Distributed Systems
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....
ICPPW
2005
IEEE
15 years 3 months ago
Content Oriented Communications for Emergencies in Wireless Environments
In the conventional WWW search or P2P file sharing systems, users search for some information by using the Explicit Information such as keywords, addresses or content names. Howev...
Kazuya Sakai, Hiroki Nakano, Akiko Nakaniwa, Hiroy...
NSPW
2003
ACM
15 years 2 months ago
Locality: a new paradigm for thinking about normal behavior and outsider threat
Locality as a unifying concept for understanding the normal behavior of benign users of computer systems is suggested as a unifying paradigm that will support the detection of mal...
John McHugh, Carrie Gates