𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel testing for system diagnosis and a scheduling algorithm

✍ Scribed by Ping Ni; Kaiyuan Huang

Publisher
Elsevier Science
Year
1987
Weight
255 KB
Volume
20
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Host-diagnosis algorithms for parallel s
Host-diagnosis algorithms for parallel systems
✍ Oum-El-Kheir Benkahla πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 252 KB

This paper presents an o-line diagnosis strategy for parallel message-passing systems. This strategy, called hostdiagnosis, allows a host system to perform centralized diagnosis of the system state, given results of distributed tests performed among the system processors. It is useful for a manufact

A parallel optimization algorithm for mi
A parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem
✍ Hironori Kasahara; Atsusi Itoh; Hisamitsu Tanaka; Keisuke Itoh πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 944 KB

## Abstract This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution‐time multiprocessor scheduling problem which is a strong NP‐hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS am

Models and Scheduling Algorithms for Mix
Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs
✍ Soumen Chakrabarti; James Demmel; Katherine Yelick πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 400 KB

An increasing number of scientific programs exhibit two forms of parallelism, often in a nested fashion. At the outer level, the application comprises coarse-grained task parallelism, with dependencies between tasks reflected by an acyclic graph. At the inner level, each node of the graph is a data-

A min-sum 3/2-approximation algorithm fo
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
✍ FabiΓ‘n A. Chudak πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 70 KB πŸ‘ 1 views

We consider the problem of minimizing the sum of weighted completion times of jobs scheduled on unrelated parallel machines. That is, there are n jobs and m machines; job j takes p GH units of time if processed on machine i and has a weight w H . If C H is the completion time of job j, the objective