Proceedings of the 6th international workshop on Hardware/software codesign
Performance Estimation for Real-Time Distributed Embedded Systems
IEEE Transactions on Parallel and Distributed Systems
Performance of real-time bus scheduling algorithms
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Networks on Silicon: Blessing or Nightmare?
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Modeling bus scheduling policies for real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
High-Level Modeling and Design of Asynchronous Arbiters for On-Chip Communication Systems
Proceedings of the conference on Design, automation and test in Europe
A Network on Chip Architecture and Design Methodology
ISVLSI '02 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Platune: a tuning framework for system-on-a-chip platforms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
The number of bus transactions in System-on-Chip (SoC) grows significantly in recent years. Because of different timing constraints for different applications, how to find a proper priority assignment for processing elements (PEs) of SoC becomes very challenging. In this paper, we first show that the priority assignment problem with one unique priority for each PE is NP-complete. When each bus transaction can have one unique priority, we propose an optimal priority assignment algorithm for a given workload. We then propose a priority assignment strategy based on Simulated Annealing (SA) for PEs, where bus arbitration is done in a priority-driven fashion. The objective is to minimize the number of priorities needed for each PE and to satisfy the timing constraints of applications. The experimental results show some encouraging results in priority assignment.