Scheduling preemptive multiprocessor tasks on dedicated processors
From MaRDI portal
Publication:4309189
DOI10.1016/0166-5316(94)90058-2zbMath0941.68519WikidataQ57387887 ScholiaQ57387887MaRDI QIDQ4309189
Paolo Dell'Olmo, Maciej Drozdowski, Jacek Błażewicz, Lucio Bianco
Publication date: 1 November 1994
Published in: Performance Evaluation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-5316(94)90058-2
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Scheduling multiprocessor tasks -- An overview, Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors