Sciweavers

2131 search results - page 390 / 427
» Immunity for Closed Sets
Sort
View
SIGCOMM
1997
ACM
15 years 10 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 10 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ASPLOS
1996
ACM
15 years 10 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
ISCA
1994
IEEE
129views Hardware» more  ISCA 1994»
15 years 10 months ago
Software Versus Hardware Shared-Memory Implementation: A Case Study
We comparethe performance of software-supported shared memory on a general-purpose network to hardware-supported shared memory on a dedicated interconnect. Up to eight processors,...
Alan L. Cox, Sandhya Dwarkadas, Peter J. Keleher, ...
CONPAR
1994
15 years 10 months ago
A Framework for Resource-Constrained Rate-Optimal Software Pipelining
The rapid advances in high-performancecomputer architectureand compilationtechniques provide both challenges and opportunitiesto exploitthe rich solution space of software pipeline...
Ramaswamy Govindarajan, Erik R. Altman, Guang R. G...