Sciweavers

5183 search results - page 949 / 1037
» The Complexity of Distributions
Sort
View
MOBIHOC
2004
ACM
16 years 5 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
PPOPP
2010
ACM
16 years 2 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
ICWS
2009
IEEE
16 years 2 months ago
Wrap Scientific Applications as WSRF Grid Services Using gRAVI
— Web service models are increasingly being used in the Grid community as way to create distributed applications exposing data and/or applications through self describing interfa...
Kyle Chard, Wei Tan, Joshua Boverhof, Ravi K. Madd...
SPAA
2009
ACM
16 years 2 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
ICDCS
2009
IEEE
16 years 2 months ago
Pushing the Envelope: Extreme Network Coding on the GPU
While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high compu...
Hassan Shojania, Baochun Li