scientific article; zbMATH DE number 1487943

zbMATH Open0959.68004MaRDI QIDQ4495070FDOQ4495070

Authors:

Publication date: 3 May 2001

Title of this publication is not available (Why is that?)

Recommendations

• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
• An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
• Preemptive multiprocessor task scheduling with release times and time windows
• Scheduling parallel tasks with sequential heads and tails

zbMATH Keywords

parallel programscheduling of taskspreemptive task model

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (9)

• Title not available (Why is that?)
• Preemptive multiprocessor task scheduling with release times and time windows
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Title not available (Why is that?)
• Serial vs. Concurrent scheduling of transmission and processing tasks in collaborative systems
• Title not available (Why is that?)
• From non-preemptive to preemptive scheduling using synchronization synthesis
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495070)