Sciweavers

4539 search results - page 390 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CG
2008
Springer
15 years 6 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
JOT
2008
123views more  JOT 2008»
15 years 6 months ago
An MOF2-based Services Metamodel
As Service-Oriented Computing is gaining mainstream adoption, Services are emerging as core-building blocks of today's applications. In particular, web services have become t...
Harshavardhan Jegadeesan, Sundar Balasubramaniam
IPPS
2010
IEEE
15 years 4 months ago
Parallel I/O performance: From events to ensembles
Parallel I/O is fast becoming a bottleneck to the research agendas of many users of extreme scale parallel computers. The principle cause of this is the concurrency explosion of hi...
Andrew Uselton, Mark Howison, Nicholas J. Wright, ...
IPPS
2010
IEEE
15 years 4 months ago
Using focused regression for accurate time-constrained scaling of scientific applications
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
Bradley J. Barnes, Jeonifer Garren, David K. Lowen...
CGF
2007
128views more  CGF 2007»
15 years 6 months ago
Stackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet availa...
Stefan Popov, Johannes Günther, Hans-Peter Se...