Zygos: Achieving low tail latency for microsecond-scale networked tasks
This paper focuses on the efficient scheduling on multicore systems of very fine-grain
networked tasks, which are the typical building block of online data-intensive applications …
networked tasks, which are the typical building block of online data-intensive applications …
Cyber physical systems: Design challenges
EA Lee - 2008 11th IEEE international symposium on object …, 2008 - ieeexplore.ieee.org
Cyber-Physical Systems (CPS) are integrations of computation and physical processes.
Embedded computers and networks monitor and control the physical processes, usually …
Embedded computers and networks monitor and control the physical processes, usually …
[PDF][PDF] Cyber-physical systems-are computing foundations adequate
EA Lee - Position paper for NSF workshop on cyber-physical …, 2006 - ptolemy.berkeley.edu
1 Summary Cyber-Physical Systems (CPS) are integrations of computation with physical
processes. Embedded computers and networks monitor and control the physical processes …
processes. Embedded computers and networks monitor and control the physical processes …
[图书][B] Robust composition: Towards a uni ed approach to access control and concurrency control
M Miller - 2006 - jscholarship.library.jhu.edu
When separately written programs are composed so that they may cooperate, they may
instead destructively interfere in unanticipated ways. These hazards limit the scale and …
instead destructively interfere in unanticipated ways. These hazards limit the scale and …
[PDF][PDF] Computing foundations and practice for cyber-physical systems: A preliminary report
EA Lee - University of California, Berkeley, Tech. Rep. UCB …, 2007 - eecs.berkeley.edu
Abstract Cyber-Physical Systems (CPS) are integrations of computation and physical
processes. Embedded computers and networks monitor and control the physical processes …
processes. Embedded computers and networks monitor and control the physical processes …
Context-bounded analysis of concurrent queue systems
We show that the bounded context-switching reachability problem for concurrent finite
systems communicating using unbounded FIFO queues is decidable, where in each context …
systems communicating using unbounded FIFO queues is decidable, where in each context …
Comparing the performance of web server architectures
D Pariag, T Brecht, A Harji, P Buhr, A Shukla… - ACM SIGOPS …, 2007 - dl.acm.org
In this paper, we extensively tune and then compare the performance of web servers based
on three different server architectures. The μserver utilizes an event-driven architecture, Knot …
on three different server architectures. The μserver utilizes an event-driven architecture, Knot …
Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives
P Li, S Zdancewic - Acm sigplan notices, 2007 - dl.acm.org
This paper proposes to combine two seemingly opposed programming models for building
massively concurrent network services: the event-driven model and the multithreaded …
massively concurrent network services: the event-driven model and the multithreaded …
[PDF][PDF] Events Can Make Sense.
MN Krohn, E Kohler, MF Kaashoek - USENIX Annual Technical …, 2007 - usenix.org
Tame is a new event-based system for managing concurrency in network applications. Code
written with Tame abstractions does not suffer from the “stackripping” problem associated …
written with Tame abstractions does not suffer from the “stackripping” problem associated …
Interprocedural analysis of asynchronous programs
R Jhala, R Majumdar - ACM SIGPLAN Notices, 2007 - dl.acm.org
An asynchronous program is one that contains procedure calls which are not immediately
executed from the callsite, but stored and" dispatched" in a non-deterministic order by an …
executed from the callsite, but stored and" dispatched" in a non-deterministic order by an …