Maciej Drozdowski  Home/Search
Context Related
| cs.put.poznan.pl/mdrozdowsk...multi2.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cs.put.poznan.pl/mdrozdowski/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems. In this work we present the state of the art for multiprocessor task scheduling. We show the rationale behind the concept of multiprocessor tasks. The standard three-field notation is extended to accommodate multiprocessor tasks. The main part of the work is presentation of the results in multiprocessor... (Update)
Similar documents based on text: More All
0.9: Scheduling Multiprocessor Tasks on Two Parallel Processors - Blazewicz, dell'Olmo.. (2002) (Correct)
0.3: Scheduling Multiprocessor Tasks for Mean Flow Time Criterion - Drozdowski, Dell'Olmo (Correct)
0.2: On Maximizing the Throughput of Multiprocessor Tasks - Fishkin, Zhang (2002) (Correct)
BibTeX entry: (Update)
M. Drozdowski. Scheduling Multiprocessor Tasks - An Overview. Private communication, (1996) http://citeseer.ist.psu.edu/drozdowski96scheduling.html More
@misc{ drozdowski96scheduling,
author = "M. Drozdowski",
title = "Scheduling Multiprocessor Tasks - An Overview",
text = "M. Drozdowski. Scheduling Multiprocessor Tasks - An Overview. Private communication,
(1996)",
year = "1996",
url = "citeseer.ist.psu.edu/drozdowski96scheduling.html" }
Citations (may not include all citations):212 Optimization and approximation in deterministic sequencing a.. (context) - Graham, Lawler et al. - 1979
121 Using processor affinity in loop scheduling on shared-memory.. - Markatos, LeBlanc - 1994
111 Computer and job-shop scheduling theory (context) - Coffman, editor - 1976
99 Gang scheduling performance benefits for fine-grain synchron.. (context) - Feitelson, Rudolph - 1992
96 Scheduling Algorithms (context) - Brucker - 1995
80 Application scheduling and processor allocation in multiprog.. - Sevcik - 1994
57 Complexity of scheduling parallel task systems (context) - Du, Y-T - 1989
56 the connection assignment problem of diagnosable systems (context) - Preparata, Metze et al. - 1967
51 Multiprocessor scheduling with communication delays (context) - Veltman, Lageweg et al. - 1990
45 FTMP - A highly reliable faulttolerant multiprocessor for ai.. (context) - Hopkins, Lala et al. - 1978
43 Models and algorithms for coscheduling compute-intensive tas.. (context) - Atallah, Black et al. - 1992
41 Scheduling in Computer and Manufacturing Systems (context) - lazewicz, Ecker et al. - 1993
40 The effect of scheduling discipline on spin overhead in shar.. (context) - Zahorjan, Lazowska et al. - 1991
36 Job scheduling is more important than processor allocation f.. (context) - Krueger, Lai et al. - 1994
30 Scheduling multiprocessor tasks to minimize schedule length (context) - lazewicz, Drabowski et al. - 1986
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC