Sciweavers

697 search results - page 23 / 140
» Strategies to Parallelize ILP Systems
Sort
View
HIPC
2007
Springer
14 years 2 months ago
A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications
As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
John Paul Walters, Vipin Chaudhary
CW
2005
IEEE
14 years 2 months ago
Strategy for Displaying the Recognition Result in Interactive Vision
This paper describes a choice strategy to ease user’s burdens for an interactive object recognition system when the system obtains multiple object candidates as a recognition re...
Yasushi Makihara, Jun Miura, Yoshiaki Shirai, Nobu...
IPPS
1993
IEEE
14 years 18 days ago
Parallel Algorithms for Hypercube Allocation
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
Yeimkuan Chang, Laxmi N. Bhuyan
HPCC
2010
Springer
13 years 8 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
ICDCS
2002
IEEE
14 years 1 months ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao