Learn More
Computer systems researchers have begun to apply the Foreground-Background (FB) scheduling discipline to a variety of applications, and as a result, there has been a resurgence in theoretical research studying FB. In this paper, we bring together results from both of these research streams to provide a survey of state-of-the-art theoretical results(More)
Recently, the class of SMART scheduling policies has been introduced in order to formalize the common heuristic of " biasing toward small jobs. " We study the tail of the sojourn-time (response-time) distribution under both SMART policies and the Foreground-Background policy (FB) in the GI/GI/1 queue. We prove that these policies behave very well under(More)
We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M X /G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M /G/1/n) systems. We show the somewhat surprising result that for three variations of the(More)
Wireless sensor networks are decentralised networks consisting of sensors that can detect events and transmit data to neighbouring sensors. Ideally, this data is eventually gathered in a central base station. Wireless sensor networks have many possible applications. For example, they can be used to detect gas leaks in houses or fires in a forest. In this(More)