Sciweavers

6834 search results - page 128 / 1367
» Informal communication in collaboratories
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
FOCS
2002
IEEE
15 years 11 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
COOPIS
2004
IEEE
15 years 10 months ago
Evaluation of a Group Communication Middleware for Clustered J2EE Application Servers
Abstract. Clusters have become the de facto platform to scale J2EE application servers. Each tier of the server uses group communication to maintain consistency between replicated ...
Takoua Abdellatif, Emmanuel Cecchet, Renaud Lachai...
HICSS
2003
IEEE
101views Biometrics» more  HICSS 2003»
15 years 11 months ago
Omnisphere: a Personal Communication Environment
Small ubiquitous devices connected by wireless networks will become future Internet appliances. To support them, communication networks must evolve to seamlessly assist appliances...
Franck Rousseau, Justinian Oprescu, Laurentiu-Sori...
CGO
2009
IEEE
15 years 10 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky