Sciweavers

734 search results - page 85 / 147
» Multiprocess Time Queue
Sort
View
110
Voted
DAM
2010
104views more  DAM 2010»
14 years 11 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
15 years 6 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
124
Voted
ENTCS
2007
178views more  ENTCS 2007»
15 years 17 days ago
Recent Advances in Real-Time Maude
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
Peter Csaba Ölveczky, José Meseguer
ISORC
2003
IEEE
15 years 5 months ago
Probabilistic Simulation-Based Analysis of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
Anders Wall, Johan Andersson, Christer Norströ...
SPAA
1996
ACM
15 years 4 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher