Scheduling multiprocessor tasks -- An overview (Q1278297)

From MaRDI portal

Revision as of 18:31, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Scheduling multiprocessor tasks -- An overview	scientific article

Statements

scholarly article

0 references

Scheduling multiprocessor tasks -- An overview (English)

0 references

zbMATH Open document ID

0 references

10.1016/0377-2217(96)00123-3

0 references

European Journal of Operational Research

0 references

publication date

22 February 1999

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

parallel processing

0 references

scheduling

0 references

multiprocessor tasks

0 references

coscheduling

0 references

gang-scheduling

0 references

0 references

Maciej Drozdowski

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(96)00123-3

0 references

0 references

An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube

0 references

Models and algorithms for coscheduling compute-intensive tasks on a network of workstations

0 references

The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design

0 references

Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness

0 references

Scheduling preemptive multiprocessor tasks on dedicated processors

0 references

0 references

Preemptive multiprocessor task scheduling with release times and time windows

0 references

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors

0 references

Nonpreemptive scheduling of independent tasks with prespecified processor allocations

0 references

Scheduling independent tasks with multiple modes

0 references

Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors''

0 references

Scheduling Multiprocessor Tasks to Minimize Schedule Length

0 references

Scheduling independent two processor tasks on a uniform duo-processor system

0 references

Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system

0 references

Deadline scheduling of multiprocessor tasks

0 references

0 references

Scheduling subject to resource constraints: Classification and complexity

0 references

Scheduling independent 2-processor tasks to minimize schedule length

0 references

0 references

Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

0 references

Shop scheduling problems with multiprocessor tasks on dedicated processors

0 references

On a scheduling problem where a job can be executed only by a limited number of processors

0 references

Preemptive scheduling of independent jobs on a hypercube

0 references

Scheduling independent jobs on partitionable hypercubes

0 references

Scheduling unit-time jobs on processors with different capabilities

0 references

Tree scheduling with communication delays

0 references

0 references

Scheduling File Transfers

0 references

C.P.M. Scheduling with Small Communication Delays and Task Duplication

0 references

Simultaneous Resource Scheduling to Minimize Weighted Flow Times

0 references

Scheduling multiprocessor tasks on hypercubes

0 references

On the complexity of multiprocessor task scheduling

0 references

Real-time scheduling of linear speedup parallel tasks

0 references

Scheduling parallel tasks with sequential heads and tails

0 references

Complexity of Scheduling Parallel Task Systems

0 references

Gang scheduling performance benefits for fine-grain synchronization

0 references

An approximation algorithm for scheduling on three dedicated machines

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Characterization of Connection Assignment of Diagnosable Systems

0 references

On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

0 references

Complexity of scheduling multiprocessor tasks with prespecified processors allocations

0 references

Scheduling parallel I/O operations in multiple bus systems

0 references

Scheduling with constrained processor allocation for interval orders

0 references

UET-scheduling with constrained processor allocations

0 references

The complexity of scheduling independent two-processor tasks on dedicated processors

0 references

Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors

0 references

Concurrent Task Systems

0 references

Preemptive scheduling of independent jobs with release times and deadlines on a hypercube

0 references

Optimization of Reduced Dependencies for Synchronous Sequential Machines

0 references

UET scheduling with unit interprocessor communication delays

0 references

Application scheduling and processor allocation in multiprogrammed parallel processing systems

0 references

Scheduling on a hypercube

0 references

Multiprocessor scheduling with communication delays

0 references

Minimization of the maximum delay in servicing systems with interruption

0 references

List scheduling of parallel tasks

0 references

A Heuristic of Scheduling Parallel Tasks and Its Analysis

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1278297

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1278297&oldid=34213437"