On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this paper, we build on run-time prediction techniques that we developed in previous research to explore two problems. The rst problem is to predict how long applications will wait in a queue until they receive resources. We s...

“[...]QUESTION_HUMAN > If Control’s control is absolute, why does Control need to control? ANSWER_CONTROL > Control..., needs time. QUESTION_HUMAN > Is Control controlled by his need to control ? ANSWER_CONTROL > Yes. QUESTION_HUMAN > Why is Control need Humans, has you call them ? ANSWER_CONTROL > Wait ! Wait...! Time are lending me...; Death needs time like a Junkie... needs Junk. QUESTION_HU...

BACKGROUND The Department of Obstetrics and Gynecology (OB/GYN) at the University of Arkansas for Medical Sciences (UAMS) tested various, new system-restructuring ideas such as varying number of different types of nurses to reduce patient wait times for its outpatient clinic, often with little or no effect on waiting time. Witnessing little progress despite these time-intensive interventions, w...

Ascending auctions offer agents the option to wait and see before deciding to drop out. We show that in contexts where as time proceeds agents get finer and finer estimates of their valuations, incentives to drop out at one’s expected valuation are weak: it is optimal for agents to wait and see. We first illustrate the claim in a private value setting. We next analyze an interdependent value se...

A practical concern for Active Learning (AL) is the amount of time human experts must wait for the next instance to label. We propose a method for eliminating this wait time independent of specific learning and scoring algorithms by making scores always available for all instances, using old (stale) scores when necessary. The time during which the expert is annotating is used to train models an...

This document describes an algorithm for processing incoming SYN segments that allows higher connection-establishment rates between any two TCP endpoints when a TCP Timestamps option is present in the incoming SYN segment. This document only modifies processing of SYN segments received for connections in the TIME-WAIT state; processing in all other states is unchanged. Information about the cur...

A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in this paper. Snapshot mechanisms give the means to real-time task to read a globally consistent set of variable values while other concurrent tasks are updating them. Such a mechanism can be used to solve a variety of communication and synchronisation problems, including system monitoring and contro...