High-level synthesis scheduling and allocation using genetic algorithms
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
A solution methodology for exact design space exploration in a three-dimensional design space
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Recent developments in high-level synthesis
ACM Transactions on Design Automation of Electronic Systems (TODAES)
IEEE Transactions on Computers
Space-time scheduling of instruction-level parallelism on a raw machine
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A tool for partitioning and pipelined scheduling of hardware-software systems
Proceedings of the 11th international symposium on System synthesis
Low-power memory mapping through reducing address bus activity
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Enhanced Simulated Annealing Techniques for Multiprocessor Scheduling
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Evolutionary Scheduling: A Review
Genetic Programming and Evolvable Machines
A backtracking instruction scheduler using predicate-based code hoisting to fill delay slots
CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Allocating Tasks in Multi-core Processor based Parallel System
NPC '07 Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
A Problem-Specific Genetic Algorithm for Multiprocessor Real-Time Task Scheduling
ICICIC '08 Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special issue on the 2009 ACM/IEEE international symposium on networks-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Constraint analysis for DSP code generation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Datapath synthesis using a problem-space genetic algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Near-Optimal Microprocessor and Accelerators Codesign with Latency and Throughput Constraints
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
The scheduling problem is an important partially solved topic related to a wide range of scientific fields. As it applies to design-time mapping on multiprocessing platforms emphasizing on ordering in time and assignment in place, significant improvements can be achieved. To support this improvement, this article presents a complete systematic classification of the existing scheduling techniques solving this problem in a (near-)optimal way. We show that the proposed approach covers any global scheduling technique, including also future ones. In our systematic classification a technique may belong to one primitive class or to a hybrid combination of such classes. In the latter case the technique is efficiently decomposed into more primitive components each one belonging to a specific class. The systematic classification assists in the in-depth understanding of the diverse classes of techniques which is essential for their further improvement. Their main characteristics and structure, their similarities and differences, and the interrelationships of the classes are conceived. In this way, our classification provides guidance for contributing in novel ways to the broad domain of global scheduling techniques.