• Publications
  • Influence
A scheduling model for reduced CPU energy
TLDR
We propose a simple model of job scheduling in which each job is to be executed between its arrival time and deadline by a single variable-speed processor as described above. Expand
  • 1,493
  • 168
  • PDF
Analysis and simulation of a fair queueing algorithm
TLDR
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. Expand
  • 2,143
  • 163
MACAW: a media access protocol for wireless LAN's
TLDR
We study media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center. Expand
  • 1,557
  • 158
MACAW: a media access protocol for wireless LAN's
TLDR
We study media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center. Expand
  • 987
  • 147
  • PDF
Managing update conflicts in Bayou, a weakly connected replicated storage system
TLDR
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. Expand
  • 1,136
  • 98
  • PDF
Scheduling for reduced CPU energy
TLDR
We introduce a new metric for cpu energy performance, millions-of-instructions-per-joule (MIPJ). Expand
  • 1,271
  • 86
  • PDF
Analysis and simulation of a fair queueing algorithm
TLDR
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. Expand
  • 1,252
  • 80
  • PDF
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
TLDR
The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and l, place the elements of L into a minimum number $L^ * $ of bins so that no bin contains numbers whose sum exceeds l. Expand
  • 827
  • 61
  • PDF
Flexible update propagation for weakly consistent replication
TLDR
This paper presents the anti-entropy protocol for update propagation between weakly consistent storage replicas is based on pair-wise communication, the propagation of write operations, and a set of ordering and closure constraints. Expand
  • 606
  • 59
  • PDF
Epidemic algorithms for replicated database maintenance
TLDR
When a database is replicated at many sites, maintaining mutual consistency among the sites in the face of updates is a significant problem. Expand
  • 822
  • 56