the energy used by the cpu. We introduce a new metric for cpu energy performance, millions-of-instructions-per-joule (MIPJ). We examine a class of methods to reduce MIPJ that are characterized by dynamic control of system clock speed by the operating system scheduler. Reducing clock speed alone does

A challenging research issue in high speed networking is how to control the transmission rate of statistical data P OWS. This paper describes a new algorithm, Virtual-Clock, for data trafic control in high-speed networks. VirtualClock maintains the statistical multiplexing flexibility of packet

Dutch and first-price sealed bid auctions in the laboratory, with a specific emphasis on the speed of the clock in the Dutch auction. At fast clock speeds, revenue in the Dutch auction is significantly lower than it is in the sealed bid auction. When the clock is sufficiently slow, however, revenue

minipump (induces tolerance). Interval timing was evaluated throughout administration and withdrawal. Injections of cocaine caused immediate, proportional, leftward shifts in peak times, indicating an increase in the speed of an internal clock. These shifts grew progressively larger with repeated

The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, instruction window wakeup and selection logic, and operand bypassing are ana-lyzed. Each is modeled and Spice simulated

This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a self

to another and a known fixed upper bound (I, on the relative speeds of different processors. In an asynchronous system no fixed upper bounds A and (I, exist. In one version of partial synchrony, fixed bounds A and (I, exist, but they are not known a priori. The problem is to design protocols that work

Introduction and related literature The role of timing in markets has been receiving an increasing amount of attention in the economics literature. Roth and Xing (1994) start their paper by pointing out that "The timing of transactions is a little-studied feature of markets, but one which pla ys a large role in their ability to function." The popularity of Internet auctions, such as eBay, has made timing issues in auctions particularly salient. Traditional auction houses, such as Christie's, require bidders or their representatives to assemble at a specific place and time, and therefore auctions must be conducted fairly quickly (often lasting less than an hour). In contrast, Internet auctions allow geographically dispersed bidders to participate, making it possible to conduct auctions that last many days. One disadvantage of long Internet auctions is that they may impose high monitoring costs on the bidders, affecting the strategy of the bidders and the revenues of the auctioneer.

offer convincing evidence thus far that the 21264 achieves this goal and will continue to set a high performance standard. A unique combination of high clock speeds and advanced microarchitectural techniques, including many forms of out-of-order and speculative execution, provide exceptional core

We propose a small number of basic concepts that can be used to explain the architecture of fault-tolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding fault-tolerant distributed systems.