Sciweavers

575 search results - page 78 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
IPPS
2009
IEEE
14 years 3 months ago
Improving RDMA-based MPI eager protocol for frequently-used buffers
MPI is the main standard for communication in high-performance clusters. MPI implementations use the Eager protocol to transfer small messages. To avoid the cost of memory registr...
Mohammad J. Rashti, Ahmad Afsahi
JSSPP
2009
Springer
14 years 3 months ago
Scheduling Restartable Jobs with Short Test Runs
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
Ojaswirajanya Thebe, David P. Bunde, Vitus J. Leun...
ICPP
2008
IEEE
14 years 3 months ago
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu
IPPS
2007
IEEE
14 years 3 months ago
A new framework to accelerate Virtex-II Pro dynamic partial self-reconfiguration
The Xilinx Virtex family of FPGAs provides the ability to perform partial run-time reconfiguration, also known as dynamic partial reconfiguration (DPR). Taking this concept one st...
Christopher Claus, Florian Helmut Müller, Joh...