Sciweavers

3335 search results - page 317 / 667
» Grid result checking
Sort
View
184
Voted
IPPS
2002
IEEE
15 years 11 months ago
Predicting the Performance of Wide Area Data Transfers
As Data Grids become more commonplace, large data sets are being replicated and distributed to multiple sites, leading to the problem of determining which replica can be accessed ...
Sudharshan Vazhkudai, Jennifer M. Schopf, Ian T. F...
JAVA
2001
Springer
15 years 11 months ago
Implementation of a portable software DSM in Java
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
Yukihiko Sohda, Hidemoto Nakada, Satoshi Matsuoka
VVS
2000
IEEE
130views Visualization» more  VVS 2000»
15 years 11 months ago
A practical evaluation of popular volume rendering algorithms
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
Michael Meißner, Jian Huang, Dirk Bartz, Kla...
GD
1997
Springer
15 years 10 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
ICPP
1994
IEEE
15 years 10 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández