Sciweavers

155 search results - page 14 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
DATE
2009
IEEE
115views Hardware» more  DATE 2009»
15 years 6 months ago
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
—As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most kn...
Mircea Negrean, Simon Schliecker, Rolf Ernst
ICALP
2010
Springer
15 years 1 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
ECRTS
1999
IEEE
15 years 4 months ago
Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach
In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium ac...
Eduardo Tovar, Francisco Vasques, Alan Burns
MST
2011
200views Hardware» more  MST 2011»
14 years 6 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
COMCOM
2004
110views more  COMCOM 2004»
14 years 11 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu