This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine...

In active networks, much processing power is required for the execution of packet processing code that is carried in or referenced by active packets. In high-bandwidth environments the processor performing this active processing poses a bottleneck. We present a processor scheduling algorithm called Feedback De cit Round Robin (FDRR) that reduces the overhead for fair scheduling and context swit...

A scheduling method for implementing a generic linear QR array processor architecture is presented. This improves on previous work. It also considerably simplifies the derivation of schedules for a folded linear system, where detailed account has to be taken of processor cell latency. The architecture and scheduling derived provide the basis of a generator for the rapid design of System-on-a-Ch...

Real-time systems like pervasive computing have to complete executing a task within the predetermined time while ensuring that the execution results are logically correct. Such systems require intelligent scheduling methods that can adequately promptly distribute the given tasks to a processor(s). In this paper, we propose LSTR (Least Slack Time Rate first), a new and simple scheduling algorith...

A framework for scheduling a number of di erent applications on a single shared preemptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeo is identi ed and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs supported on the one hand, and the added context-switch...

This paper explores the feasibility of using lottery scheduling , a proportional-share resource management algorithm, to schedule processes under the FreeBSD operating system. Proportional-share scheduling enables exible control over relative process execution rates and processor load insulation among groups of processes. We show that a straight implementation of lottery scheduling performs wor...

EEcient allocation of distinct subsets of processors to diierent jobs (i.e., space sharing) is critical to the performance of parallel computers, especially large scale parallel computers. This paper presents an eecient and lookahead strategy for processor allocation in 3D torus-connected systems, such as the Cray T3D, where each job requests for an exclusive allocation of a 3D submesh. The pro...