Sciweavers

1872 search results - page 54 / 375
» The Art of Granular Computing
Sort
View
IVC
2000
179views more  IVC 2000»
13 years 9 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
CCGRID
2007
IEEE
14 years 4 months ago
Dynamic Malleability in Iterative MPI Applications
Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to...
Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K...
EUROPAR
2009
Springer
14 years 2 months ago
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures
One has a large workload that is “divisible” (its constituent work’s granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in comp...
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Fr&...
PLDI
2010
ACM
14 years 3 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
HPDC
2002
IEEE
14 years 2 months ago
Multigrain Parallelism for Eigenvalue Computations on Networks of Clusters
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
James R. McCombs, Andreas Stathopoulos