Sciweavers

395 search results - page 1 / 79
» Determining the Idle Time of a Tiling: New Results
Sort
View
JISE
1998
84views more  JISE 1998»
13 years 4 months ago
Determining the Idle Time of a Tiling: New Results
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
Frederic Desprez, Jack Dongarra, Fabrice Rastello,...
PC
2006
124views Management» more  PC 2006»
13 years 4 months ago
Message-passing code generation for non-rectangular tiling transformations
Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning th...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...
DNA
2006
Springer
146views Bioinformatics» more  DNA 2006»
13 years 8 months ago
On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...
IPTPS
2004
Springer
13 years 10 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
IPPS
2007
IEEE
13 years 11 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...