Look-ahead dynamic inter-processor connection reconfiguration is a multi-processor architectural model, which has been proposed to eliminate connection reconfiguration time overheads. It consists in preparing link connections in advance in parallel with program execution. An application program is partitioned into sections, which are executed using redundant communication resources. Parallel pr...

Simultaneous multithreading (SMT) improves processor throughput by processing instructions from multiple threads each cycle. This is the first work to explore soft real-time scheduling on an SMT processor. Scheduling with SMT requires two decisions: (1) which threads to run simultaneously (the co-schedule), and (2) how to share processor resources among co-scheduled threads. We explore algorith...

In this work we study a special type of task scheduling referred to as epoch scheduling in a distributed server (processor) system. With this policy, processor queues are rearranged only at the end of predefined intervals. The time interval between successive queue rearrangements is called an epoch. The objective is to examine if epoch scheduling can perform close to STF method and achieve fair...

Distributed method invocations require dynamic scheduling algorithms and efficient resource projections to provide timeliness guarantees to application objects. In this paper we present a dynamic scheduling algorithm that examines the computation times, real times and resource requirements of the application tasks to determine a feasible schedule for the method invocations. The schedule is driv...

This paper discusses the preliminary performance study of hybrid multithreaded execution model that combines software-controlled multithreaded system with hardware support for efficient context switching and threads scheduling. The hardware support for multithreading is augmented with a software thread scheduling technique called set scheduling, and their benefit to the overall performance is d...

We propose a new process scheduling queue system called the Distributed Queue Tree (DQT) for a distributed memory, dynamically partitionable parallel machines. We assume that partitions can be nested dynamically and that a process in a partition can be preempted. The combination of dynamically nested partitioning and time-sharing scheduling may provide an interactive environment and higher proc...

In this paper, we present a task scheduling heuristic, based on a parallel genetic algorithm (PGA). The algorithm schedules parallel programs, represented as directed acyclic graphs (DAGs), onto multi-processor systems with dynamic interconnection networks (DIN). It combines PGA with list scheduling approach and takes into account inter-processor communication cost, link contention in the DIN a...

This paper introduces a new scheduling algorithm for parallel single-agent search, 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 show that the scheme achie...