Sciweavers

283 search results - page 48 / 57
» Effective Program Verification for Relaxed Memory Models
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
104
Voted
TMC
2008
136views more  TMC 2008»
14 years 11 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
IPPS
2006
IEEE
15 years 5 months ago
Support for adaptivity in ARMCI using migratable objects
Many new paradigms of parallel programming have emerged that compete with and complement the standard and well-established MPI model. Most notable, and successful, among these are...
Chao Huang, Chee Wai Lee, Laxmikant V. Kalé
117
Voted
TPDS
2002
126views more  TPDS 2002»
14 years 11 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
IPPS
2007
IEEE
15 years 6 months ago
ParalleX: A Study of A New Parallel Computation Model
This paper proposes the study of a new computation model that attempts to address the underlying sources of performance degradation (e.g. latency, overhead, and starvation) and th...
Guang R. Gao, Thomas L. Sterling, Rick Stevens, Ma...