Sciweavers

1490 search results - page 182 / 298
» Models and Algorithms for Optical and Optoelectronic Paralle...
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
IPPS
2008
IEEE
14 years 2 months ago
A modeling approach for estimating execution time of long-running scientific applications
In a Grid computing environment, resources are shared among a large number of applications. Brokers and schedulers find matching resources and schedule the execution of the applic...
Seyed Masoud Sadjadi, Shu Shimizu, Javier Figueroa...
PODC
2009
ACM
14 years 8 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
CONCUR
2006
Springer
13 years 10 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
EOR
2008
52views more  EOR 2008»
13 years 8 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao