The spring scheduling co-processor: a scheduling accelerator

Burleson, W. ; Ko, J. ; Niehaus, D. ; Ramamritham, K. ; Stankovic, J. A. ; Wallace, G. ; Weems, C. (1999) The spring scheduling co-processor: a scheduling accelerator IEEE Transactions on Very Large Scale Integration Systems, 7 (1). pp. 1063-8210. ISSN 1063-8210

Full text not available from this repository.

Official URL:

Related URL:


The spring scheduling coprocessor is a novel very large scale integration (VLSI) accelerator for multiprocessor real-time systems. The coprocessor can be used for static as well as online scheduling. Many different policies and their combinations can be used (e.g., earliest deadline first, highest value first, or resource-oriented policies such as earliest available time first). In this paper, we describe a coprocessor architecture, a CMOS implementation, an implementation of the host/coprocessor interface and a study of the overall performance improvement. We show that the current VLSI chip speeds up the main portion of the scheduling operation by over three orders of magnitude. We also present an overall system improvement analysis by accounting for the operating system overheads and identify the next set of bottlenecks to improve. The scheduling coprocessor includes several novel VLSI features. It is implemented as a parallel architecture for scheduling that is parameterized for different numbers of tasks, numbers of resources, and internal wordlengths. The architecture was implemented using a single-phase clocking style in several novel ways. The 328 000 transistor custom 2-/spl mu/m VLSI accelerator running with a 100-MHz clock, combined with careful hardware/software co-design results in a considerable performance improvement, thus removing a major bottleneck in real-time systems.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:62920
Deposited On:24 Sep 2011 05:12
Last Modified:24 Sep 2011 05:12

Repository Staff Only: item control page