Sciweavers

102 search results - page 16 / 21
» Fair Queuing Memory Systems
Sort
View
APN
2004
Springer
14 years 1 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
CONEXT
2008
ACM
13 years 10 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
DSN
2000
IEEE
14 years 26 days ago
Executable Assertions for Detecting Data Errors in Embedded Control Systems
In order to be able to tolerate the effects of faults, we must first detect the symptoms of faults, i.e. the errors. This paper evaluates the error detection properties of an erro...
Martin Hiller
ISPASS
2006
IEEE
14 years 2 months ago
Friendly fire: understanding the effects of multiprocessor prefetches
Modern processors attempt to overcome increasing memory latencies by anticipating future references and prefetching those blocks from memory. The behavior and possible negative si...
Natalie D. Enright Jerger, Eric L. Hill, Mikko H. ...
LICS
2005
IEEE
14 years 2 months ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...