Sciweavers

6437 search results - page 370 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IPPS
2010
IEEE
15 years 2 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
IC3
2009
15 years 2 months ago
A Hybrid Grouping Genetic Algorithm for Multiprocessor Scheduling
Abstract. This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processo...
Alok Singh, Marc Sevaux, André Rossi
ICDCS
2009
IEEE
15 years 11 months ago
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is currently supported with a costly central service. In ord...
Stéphane Weiss, Pascal Urso, Pascal Molli
PDP
2008
IEEE
15 years 10 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
IPPS
2007
IEEE
15 years 10 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...