Sciweavers

1915 search results - page 274 / 383
» SystemC-Based Communication and Performance Analysis
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 9 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
INFOCOM
2009
IEEE
14 years 3 months ago
Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
SIGCOMM
2004
ACM
14 years 2 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
MOBICOM
2004
ACM
14 years 2 months ago
Exploiting medium access diversity in rate adaptive wireless LANs
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall ne...
Zhengrong Ji, Yi Yang, Junlan Zhou, Mineo Takai, R...
IPPS
2005
IEEE
14 years 2 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick