Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
On the Number of Acceptable Task Assignments in Distributed Computing Systems
IEEE Transactions on Computers
HARTS: A Distributed Real-Time Architecture
Computer - Special issue on real-time systems
Heuristic Technique for Processor and Link Assignment in Multicomputers
IEEE Transactions on Computers
Scheduling pipelined communication in distributed memory multiprocessors for real-time applications
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
On parallel processing for real-time artificial vision
On parallel processing for real-time artificial vision
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Hard Real-Time Systems
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution
IEEE Transactions on Parallel and Distributed Systems
Period-Based Load Partitioning and Assignment for Large Real-Time Applications
IEEE Transactions on Computers
The Performance Evaluation Tool for Automated Prototyping of Concurrent Cyclic Processes
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A new strategy for multiprocessor scheduling of cyclic task graphs
International Journal of High Performance Computing and Networking
The Performance Evaluation Tool for Automated Prototyping of Concurrent Cyclic Processes
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
| Hi-index | 0.00 |
This short paper presents a framework for periodic execution of task-flow graphs that enables schedulability analysis of the communication requirements. The analysis performs the steps of segmenting messages, assigning the segments to specific links and time intervals, and ordering them within the intervals to generate node switching schedules that provide contention-free message routing at run-time. The analysis is also used to integrate task allocation with message routing using a contention-based objective function. Usefulness of the proposed scheme in ensuring guaranteed communication performance is demonstrated by an appropriate example.