The vast majority of research output is grey; white (peer reviewed scholarly publications) forms a minor proportion. Historically, grey material was generated and used within an organisation. However, in recent years some researchrelevant grey material is being made openly available. Among grey outputs, research datasets are the largest proportion by volume and increasingly these are being made...

In this paper we will show our data description model conceived for avoiding the risk of realizing misleading Virtual Heritage (VH) reconstructions and for making accessible in a standardized way the background research material that lies under a "VR cultural product". The basic idea is to face the problem of the lack of standards for documenting sources in order to realize not only nice fast m...

Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more efficient than continuous levels of detail, since in the latter case the screen space error has to be verified for individual triangles. There are some prevailing problems of these approaches: i) the partitioning and simplif...

Current virtual memory systems provided for scalable computer systems typically offer poor performance for scientific applications when an application’s working data set does not fit in main memory. As a result, programmers who wish to solve “out-of-core” problems efficiently typically write a separate version of the parallel program with explicit I/O operations. This task is onerous and extrem...

In this paper, we present a framework for synthesizing I/O eecient out-of-core programs for block recursive algorithms, such as the fast Fourier transform (FFT) and block matrix transposition algorithms. Our framework uses an algebraic representation which is based on tensor products and other matrix operations. The programs are optimized for the striped Vitter and Shriver's two-level memory mo...

We describe a method to efficiently collect and filter a large set of 2D pixel observations of unstructured 3D points, with applications to scene-space aware video processing. One of the main challenges in scene-space video processing is to achieve reasonable computation time despite the very large volumes of data, often in the order of billions of pixels. The bottleneck is determining a suitab...

This paper introduces a novel master-multi-SIMD on-chip multi-core architecture for embedded signal processing. The parallel architecture and its memory subsystem are described in this paper. We evaluate the large size matrix multiplication performance on this parallel architecture and compare it with a SIMD-extended data parallel architecture. We also examine how well the new architecture scal...

Choosing an appropriate cluster file system for a specific high performance computing application is challenging and depends mainly on the specific application I/O needs. There is a wide variety of I/O requirements: Some implementations require reading and writing large datasets, others out-of-core data access, or they have database access requirements. Application access patterns reflect diffe...

ÐIn this paper, we present a framework for synthesizing I/O efficient out-of-core programs for block recursive algorithms, such as the fast Fourier transform (FFT) and block matrix transposition algorithms. Our framework uses an algebraic representation which is based on tensor products and other matrix operations. The programs are optimized for the striped Vitter and Shriver's twolevel memory ...