scientific article; zbMATH DE number 2086779

MaRDI QIDQ4737347zbMATH OpenFDO

Authors Eryk Laskowski

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2328/23280097.htm

Mathematics Subject Classification ID

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

Recommendations

• Resource-constrained scheduling of partitioned algorithms on processor arrays
• scientific article; zbMATH DE number 2090583
• Approximation algorithms for scheduling on multi-core processor with shared speedup resources
• A comparison of multiprocessor task scheduling algorithms with communication costs
• Multistep scheduling algorithm for parallel and distributed processing in heterogeneous systems with communication costs
• scientific article; zbMATH DE number 42110
• Robust partitioned scheduling for real-time multiprocessor systems

Cited in

(3)

• Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
• Parallel Processing and Applied Mathematics
• Parallel Processing and Applied Mathematics

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 Q4737347)