Sciweavers

1519 search results - page 34 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
COLCOM
2009
IEEE
15 years 7 months ago
Still alive: Extending keep-alive intervals in P2P overlay networks
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
Richard Price, Peter Tiño
APPT
2007
Springer
15 years 4 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 8 months ago
Performance aware secure code partitioning
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
Sri Hari Krishna Narayanan, Mahmut T. Kandemir, Ri...
120
Voted
HPDC
2006
IEEE
15 years 8 months ago
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Gaurav Khanna 0002, Nagavijayalakshmi Vydyanathan,...
IPPS
2006
IEEE
15 years 8 months ago
Towards a parallel framework of grid-based numerical algorithms on DAGs
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
Zeyao Mo, Aiqing Zhang, Xiaolin Cao