Sciweavers

6939 search results - page 1024 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 5 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
GRID
2004
Springer
15 years 10 months ago
Checkpoint and Restart for Distributed Components in XCAT3
With the advent of Grid computing, more and more highend computational resources become available for use to a scientist. While this opens up new avenues for scientific research,...
Sriram Krishnan, Dennis Gannon
146
Voted
LCPC
2009
Springer
15 years 9 months ago
Loop Transformation Recipes for Code Generation and Auto-Tuning
Abstract. In this paper, we describe transformation recipes, which provide a high-level interface to the code transformation and code generation capability of a compiler. These rec...
Mary W. Hall, Jacqueline Chame, Chun Chen, Jaewook...
151
Voted
EGH
2010
Springer
15 years 3 months ago
Architecture considerations for tracing incoherent rays
This paper proposes a massively parallel hardware architecture for efficient tracing of incoherent rays, e.g. for global illumination. The general approach is centered around hier...
Timo Aila, Tero Karras
HIPC
2003
Springer
15 years 10 months ago
Thread Migration/Checkpointing for Type-Unsafe C Programs
Thread migration/checkpointing is becoming indispensable for load balancing and fault tolerance in high performance computing applications, and its success depends on the migration...
Hai Jiang, Vipin Chaudhary
« Prev « First page 1024 / 1388 Last » Next »