Sciweavers

502 search results - page 44 / 101
» On the Practical Performance of Rateless Codes
Sort
View
ISCA
1995
IEEE
98views Hardware» more  ISCA 1995»
14 years 1 days ago
Instruction Fetching: Coping with Code Bloat
Previous research has shown that the SPEC benchmarks achieve low miss ratios in relatively small instruction caches. This paper presents evidence that current software-development...
Richard Uhlig, David Nagle, Trevor N. Mudge, Stuar...
PPDP
2009
Springer
14 years 3 months ago
Automatic refactoring of Erlang programs
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
Konstantinos F. Sagonas, Thanassis Avgerinos
SPAA
1993
ACM
14 years 17 days ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ICS
1999
Tsinghua U.
14 years 23 days ago
Improving the performance of bristled CC-NUMA systems using virtual channels and adaptivity
Current high-end parallel systems achieve low-latency, highbandwidth network communication through the use of aggressive design techniques and expensive mechanical and electrical ...
José F. Martínez, Josep Torrellas, J...
SIGSOFT
2008
ACM
14 years 9 months ago
Doloto: code splitting for network-bound web 2.0 applications
Modern Web 2.0 applications, such as GMail, Live Maps, Facebook and many others, use a combination of Dynamic HTML, JavaScript and other Web browser technologies commonly referred...
V. Benjamin Livshits, Emre Kiciman