Sciweavers

2544 search results - page 103 / 509
» Process pipeline scheduling
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 2 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
DMG
2005
Springer
15 years 3 months ago
An Adaptive Distributed Query Processing Grid Service
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid s...
Fabio Porto, Vinícius F. V. da Silva, M&aac...
RTSS
1998
IEEE
15 years 2 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...
INFOCOM
2007
IEEE
15 years 4 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
INFOCOM
2006
IEEE
15 years 3 months ago
Scheduling in Non-Blocking Buffered Three-Stage Switching Fabrics
— Three-stage non-blocking switching fabrics are the next step in scaling current crossbar switches to many hundreds or few thousands of ports. Congestion (output contention) man...
Nikolaos Chrysos, Manolis Katevenis