Sciweavers

44 search results - page 8 / 9
» When Abstractions Met Landmarks
Sort
View
SIGCOMM
2009
ACM
14 years 1 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 11 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
EMISA
2006
Springer
13 years 11 months ago
On Design Principles for Realizing Adaptive Service Flows with BPEL
Abstract: Web service technology offers a promising approach for realizing enterprisewide and cross-organizational business applications. With the Business Process Execution Langua...
Manfred Reichert, Stefanie Rinderle
ECRTS
2010
IEEE
13 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard