Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Comparing distributed memory and virtual shared memory parallel programming models
Future Generation Computer Systems - Special issue: massive parallel computing
P-Complete Approximation Problems
Journal of the ACM (JACM)
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
A New Task Mapping Technique for Communication-Aware Scheduling Strategies
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
On-chip networks: A scalable, communication-centric embedded system design paradigm
VLSID '04 Proceedings of the 17th International Conference on VLSI Design
Computer Organization and Design
Computer Organization and Design
CLADE '04 Proceedings of the 2nd International Workshop on Challenges of Large Applications in Distributed Environments
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Time and energy efficient mapping of embedded applications onto NoCs
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Supporting task migration in multi-processor systems-on-chip: a feasibility study
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Congestion-Aware Task Mapping in NoC-based MPSoCs with Dynamic Workload
ISVLSI '07 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
HS-Scale: a Hardware-Software Scalable MP-SOC Architecture for embedded Systems
ISVLSI '07 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
A contextual resources use: a proof of concept through the APACHES' platform
DDECS '06 Proceedings of the 2006 IEEE Design and Diagnostics of Electronic Circuits and systems
Energy- and performance-aware mapping for regular NoC architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Communication-aware heuristics for run-time task mapping on NoC-based MPSoC platforms
Journal of Systems Architecture: the EUROMICRO Journal
3D network-on-chip architectures using homogeneous meshes and heterogeneous floorplans
International Journal of Reconfigurable Computing - Special issue on selected papers from ReconFig 2009 International conference on reconfigurable computing and FPGAs (ReconFig 2009)
Mapping on multi/many-core systems: survey of current and emerging trends
Proceedings of the 50th Annual Design Automation Conference
Using task migration to improve non-contiguous processor allocation in NoC-based CMPs
Journal of Systems Architecture: the EUROMICRO Journal
On the design space exploration through the Hellfire Framework
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
We present a heuristic algorithm for the run-time distribution of task sets in a homogeneous Multiprocessor network-on-chip. The algorithm is itself distributed over the processors and thus can be applied to systems of arbitrary size. Also, tasks added at run-time can be handled without any difficulty, allowing for inline optimisation. Based on local information on processor workload, task size, communication requirements, and link contention, iterative decisions on task migrations to other processors are made. The mapping results for several example task sets are first compared with those of an exact (enumeration) algorithm with global information for a 3×3 processor array. The results show that the mapping quality achieved by our distributed algorithm is within 25% of that of the exact algorithm. For larger array sizes, simulated annealing is used as a reference and the behaviour of our algorithm is investigated. The mapping quality of the algorithm can be shown to be within a reasonable range (below 30% mostly) of the reference. This adaptability and the low computation and communication overhead of the distributed heuristic clearly indicate that decentralised algorithms are a favourable solution for an automatic task distribution.