Sciweavers

147 search results - page 20 / 30
» Polynomial Fairness and Liveness
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
DSN
2004
IEEE
14 years 1 months ago
Automated Synthesis of Multitolerance
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...
Sandeep S. Kulkarni, Ali Ebnenasir
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 12 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
APSEC
2007
IEEE
14 years 4 months ago
Coordination-Policy Based Composed System Behavior Derivation
The coordination-policy that components interactions satisfied often determines the properties of nowadays component-based information systems, e.g. Safety, Liveness and Fairness ...
Yiming Lau, Wenyun Zhao, Xin Peng, Zhixiong Jiang,...
NCA
2007
IEEE
14 years 4 months ago
Improving Network Processing Concurrency using TCPServers
Exponentially growing bandwidth requirements and slowing gains in processor speeds have led to the popularity of multiprocessor architectures. Network stack parallelism is increas...
Aniruddha Bohra, Liviu Iftode