1995 search results - page 389 / 399 » From Data Flow Networks to Process Algebras |
157
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
100
click to vote
CF
2006
ACM
15 years 3 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
CCS
2009
ACM
15 years 4 months ago
2009
ACM
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...