A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications

DOI10.1016/S0305-0548(02)00031-XzbMath1026.90054OpenAlexW2061847411MaRDI QIDQ1870819

Marco Lavoie, Gerald M. Karam, John W. Chinneck, Rafik A. Goubran, Vitória Pureza

Publication date: 14 May 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00031-x

zbMATH Keywords

mappingheuristiccritical path analysismultiprocessordigital signal processingtask assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• A comparison of list schedules for parallel processing systems
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Complexity of Scheduling under Precedence Constraints
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• Optimal File Allocation in a Multiple Computer System
• Optimal Scheduling Strategies in a Multiprocessor System

This page was built for publication: A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications