Sciweavers

1929 search results - page 101 / 386
» Load Balancing with Memory
Sort
View
GCC
2005
Springer
15 years 12 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen
ICDCS
1991
IEEE
15 years 9 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
INFOCOM
1999
IEEE
15 years 10 months ago
The TIME-WAIT State in TCP and Its Effect on Busy Servers
Hosts providing important network services such as HTTP and FTP incur a per-connection memory load from TCP that can adversely affect their connection rate and throughput. The mem...
Theodore Faber, Joseph D. Touch, Wei Yue
CAL
2010
15 years 3 months ago
SMT-Directory: Efficient Load-Load Ordering for SMT
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
A. Hilton, A. Roth
CAL
2002
15 years 6 months ago
Migration in Single Chip Multiprocessors
Global communication costs in future single-chip multiprocessors will increase linearly with distance. In this paper, we revisit the issues of locality and load balance in order to...
K. A. Shaw, William J. Dally