Sciweavers

7 search results - page 1 / 2
» Consistent Overhead Byte Stuffing
Sort
View
SIGCOMM
1997
ACM
13 years 8 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
IWMM
2007
Springer
130views Hardware» more  IWMM 2007»
13 years 10 months ago
Accordion arrays
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
Craig B. Zilles
MOBIHOC
2001
ACM
14 years 3 months ago
Distributed assignment of encoded MAC addresses in sensor networks
In wireless sensor networks, the vast majority of wide-scale traffic consists of only a few bytes, including all network and application layer IDs. Therefore, MAC addresses, which...
Curt Schurgers, Gautam Kulkarni, Mani B. Srivastav...
IWMM
2004
Springer
98views Hardware» more  IWMM 2004»
13 years 9 months ago
Dynamic object sampling for pretenuring
Many state-of-the-art garbage collectors are generational, collecting the young nursery objects more frequently than old objects. These collectors perform well because young objec...
Maria Jump, Stephen M. Blackburn, Kathryn S. McKin...
PLDI
2010
ACM
13 years 9 months ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...