2014
DOI: 10.1504/ijes.2014.064997
|View full text |Cite
|
Sign up to set email alerts
|

Hardware-software architecture for priority queue management in real-time and embedded systems

Abstract: The use of hardware-based data structures for accelerating real-time and embedded system applications is limited by the scarceness of hardware resources. Being limited by the silicon area available, hardware data structures cannot scale in size as easily as their software counterparts. We assert a hardware-software co-design approach is required to elegantly overcome these limitations. In this paper, we present a hybrid priority queue architecture that includes a hardware accelerated binary heap that can also … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…It can achieve a variety of heterogeneous network interfaces, has a wide range of network access capabilities, and can meet the requirements of management for intelligent gateways. By contrast, the rapid development of an embedded system facilitates the easy modification of the system's software and hardware [21][22][23]. It has prominent portability and can be customized based on actual demands.…”
Section: Introductionmentioning
confidence: 99%
“…It can achieve a variety of heterogeneous network interfaces, has a wide range of network access capabilities, and can meet the requirements of management for intelligent gateways. By contrast, the rapid development of an embedded system facilitates the easy modification of the system's software and hardware [21][22][23]. It has prominent portability and can be customized based on actual demands.…”
Section: Introductionmentioning
confidence: 99%
“…• A hardware accelerated binary min heap design is presented, which supports enqueue and peek operations in O(1) time, returns the top-priority element in O(1) time, and completes a dequeue operation in O(log n) time. [44] • A scalable hardware-software priority queue architecture that enables fast and low-overhead transitions of queue management between hardware and hybrid software-hardware modes of operation is proposed and evaluated. [44] In Chapter 4, a hybrid software-hardware scheduler architecture that reduces scheduling overhead and improves predictability is presented.…”
Section: Summary Of Contributionsmentioning
confidence: 99%
“…[44] • A scalable hardware-software priority queue architecture that enables fast and low-overhead transitions of queue management between hardware and hybrid software-hardware modes of operation is proposed and evaluated. [44] In Chapter 4, a hybrid software-hardware scheduler architecture that reduces scheduling overhead and improves predictability is presented. [44] In Chapter 6:…”
Section: Summary Of Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Carefully designed scheduling methods, which seek to impose additional determinism on task runtime characteristics, often impose additional runtime overhead, and still result in a stochastic computation model [16,17]. Architecture extensions to software processor architectures are also gaining interest, but at best reduce-not eliminate-software execution time uncertainty [18]. In all cases, the best-achievable runtime behavior is still stochastic in nature.…”
Section: Motivationmentioning
confidence: 99%