Sciweavers

234 search results - page 4 / 47
» Time skewing made simple
Sort
View
SAS
2000
Springer
124views Formal Methods» more  SAS 2000»
15 years 1 months ago
Code Specialization Based on Value Profiles
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
Robert Muth, Scott A. Watterson, Saumya K. Debray
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
89
Voted
MICRO
2009
IEEE
148views Hardware» more  MICRO 2009»
15 years 4 months ago
Flip-N-Write: a simple deterministic technique to improve PRAM write performance, energy and endurance
The phase-change random access memory (PRAM) technology is fast maturing to production levels. Main advantages of PRAM are non-volatility, byte addressability, in-place programmab...
Sangyeun Cho, Hyunjin Lee
CP
2004
Springer
15 years 1 months ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover
MST
2006
136views more  MST 2006»
14 years 9 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl