5658 search results - page 1015 / 1132 » An Efficient Counting Network |
152
click to vote
ICS
1999
Tsinghua U.
15 years 10 months ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...
164
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
Zero Queueing Flow Control (ZQFC) is a new creditbased flow control method for ATM networks. The receiving node of such a flow-controlled link will have zero queueoccupancy in the...
162
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 10 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
177
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
194
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...