Sciweavers

170 search results - page 32 / 34
» Interactive Animation of Fault Tolerant Parallel Algorithms
Sort
View
IPPS
2003
IEEE
14 years 3 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
PODC
2012
ACM
12 years 6 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
PDCAT
2005
Springer
14 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
ISCA
2011
IEEE
238views Hardware» more  ISCA 2011»
13 years 1 months ago
Rebound: scalable checkpointing for coherent shared memory
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
Rishi Agarwal, Pranav Garg, Josep Torrellas
PDP
2010
IEEE
14 years 4 months ago
The Design and Implementation of the SWIM Integrated Plasma Simulator
Abstract—As computing capabilities have increased, the coupling of computational models has become an increasingly viable and therefore important way of improving the physical ï¬...
Wael R. Elwasif, David E. Bernholdt, Aniruddha G. ...