Sciweavers

291 search results - page 33 / 59
» A Parallel BSP Algorithm for Irregular Dynamic Programming
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Dynamic multi phase scheduling for heterogeneous clusters
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
Florina M. Ciorba, Theodore Andronikos, Ioannis Ri...
ICDCS
2003
IEEE
14 years 2 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
SC
2003
ACM
14 years 2 months ago
Compiler Support for Exploiting Coarse-Grained Pipelined Parallelism
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
Wei Du, Renato Ferreira, Gagan Agrawal
SP
2002
IEEE
109views Security Privacy» more  SP 2002»
13 years 8 months ago
Scalable atomistic simulation algorithms for materials research
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
Aiichiro Nakano, Rajiv K. Kalia, Priya Vashishta, ...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz