A Slot-Based Real-Time Scheduling Algorithm for Concurrent Transactions in NoC

Bui, B.D.; Caccamo, Marco; Pellizzoni, Rodolfo

doi:10.1109/rtcsa.2011.44

Search citation statements

Order By: Relevance

Paper Sections

Select...

Problem Model2

Results1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2023

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare MART with NMAP [7]. NMAP is a fast heuristic mapping algorithm that optimizes bandwidth and packet latency.…”

Section: Resultsmentioning

confidence: 99%

“…Similarly, the processing element utilization is utij= eijt/ptij. Then according to the sufficient conditions for scheduling communications [7], we find a mapping function M: T->N that enables the communication set to be minimized the communication cost. In the following, we present the optimization objective and constraints of this mapping problem.…”

Section: Problem Modelmentioning

confidence: 99%

“…(3) Link Utilization Constraint: We regulate that the utilization of each link must satisfy the sufficient scheduling condition [7]. Otherwise, the communication cannot be scheduled.…”

Section: Problem Modelmentioning

confidence: 99%

See 2 more Smart Citations

A Mapping Algorithm for Real-Time Applications on Network-on-Chips

Wang¹

2015

Proceedings of the 2nd International Conference on Green Materials and Environmental Engineering

View full text Add to dashboard Cite

Networks-on-chips connect multiple cores together and have been widely used in electronic devices. This paper focuses on the mapping problem of networks-on-chips We propose an algorithm MART to improve the real-time performance of applications and minimize the communication cost. Experimental results show that RTMAP can significantly improve the acceptance rate of real-time applications which only introduces small communication cost overhead.

show abstract

“…We compare MART with NMAP [7]. NMAP is a fast heuristic mapping algorithm that optimizes bandwidth and packet latency.…”

Section: Resultsmentioning

confidence: 99%

Section: Problem Modelmentioning

confidence: 99%