Sciweavers

5171 search results - page 170 / 1035
» Deterministic Parallel Processing
Sort
View
CONCUR
2003
Springer
14 years 1 months ago
Modeling Consensus in a Process Calculus
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
Uwe Nestmann, Rachele Fuzzati, Massimo Merro
FOSSACS
2008
Springer
13 years 9 months ago
Structural Operational Semantics for Stochastic Process Calculi
Abstract. A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeter...
Bartek Klin, Vladimiro Sassone
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
ISPASS
2008
IEEE
14 years 2 months ago
Conservative vs. Optimistic Parallelization of Stateful Network Intrusion Detection
This paper presents and experimentally evaluates two parallelization strategies for the popular open-source Snort network intrusion detection system (NIDS). Snort identifies intr...
Derek L. Schuff, Yung Ryn Choe, Vijay S. Pai
IPPS
2000
IEEE
14 years 21 days ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng