Sciweavers

819 search results - page 115 / 164
» Parallelization with Tree Skeletons
Sort
View
IPPS
2010
IEEE
14 years 7 months ago
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
Bo Zhang, Binoy Ravindran
SPAA
2009
ACM
15 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
SOSP
2003
ACM
15 years 6 months ago
Bullet: high bandwidth data dissemination using an overlay mesh
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
FTDCS
2003
IEEE
15 years 3 months ago
Resource- and Quality-Aware Application-Level Service Multicast
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
Jingwen Jin, Klara Nahrstedt