Sciweavers

4075 search results - page 370 / 815
» Modeling Distributed Algorithm Using B
Sort
View
CONCUR
1997
Springer
15 years 11 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
INFOCOM
2002
IEEE
15 years 11 months ago
Analysis of Measured Single-Hop Delay from an Operational Backbone Network
— We measure and analyze the single-hop packet delay through operational routers in a backbone IP network. First we present our delay measurements through a single router. Then w...
Konstantina Papagiannaki, Sue B. Moon, Chuck Frale...
HPCC
2009
Springer
15 years 10 months ago
Kahn Process Networks are a Flexible Alternative to MapReduce
Experience has shown that development using shared-memory concurrency, the prevalent parallel programming paradigm today, is hard and synchronization primitives nonintuitive becaus...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz,...
IWMM
2004
Springer
90views Hardware» more  IWMM 2004»
16 years 5 days ago
Automatic heap sizing: taking real memory into account
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
Ting Yang, Matthew Hertz, Emery D. Berger, Scott F...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi