A Multi-Layered Image Cache A Multi-Layered Image Cache for - - PowerPoint PPT Presentation

a multi layered image cache a multi layered image cache
SMART_READER_LITE
LIVE PREVIEW

A Multi-Layered Image Cache A Multi-Layered Image Cache for - - PowerPoint PPT Presentation

A Multi-Layered Image Cache A Multi-Layered Image Cache for Scientific Visualization for Scientific Visualization Eric Lamar and Valerio Pascucci Eric Lamar and Valerio Pascucci Center for Applied Scientific Computing Center for Applied


slide-1
SLIDE 1

PVG-03-1

Valerio Pascucci

A Multi-Layered Image Cache for Scientific Visualization A Multi-Layered Image Cache for Scientific Visualization

Center for Applied Scientific Computing Lawrence Livermore National Laboratory Center for Applied Scientific Computing Lawrence Livermore National Laboratory

Eric Lamar and Valerio Pascucci Eric Lamar and Valerio Pascucci

This work was performed under the auspices of the U.S. Department of Energy by the University of California, Lawrence Livermore National Laboratory under Contract No. W-7405-Eng-48. UCRL-PRES-200743

slide-2
SLIDE 2

PVG-03-2

Valerio Pascucci

Visual data exploration requires interactive visualization tools.

The user is less frustrated by transient artifacts then by slow refresh rates. “Interactive display” is not synonym with “interactive rendering.” One obstacle to scalable visualization is the need to render everything within a single frame. A possible solution is to decouple the rendering from the display.

slide-3
SLIDE 3

PVG-03-3

Valerio Pascucci

We develop a hybrid approach to generic asynchronous rendering.

We use a light weighted display engine that reads images retrieved from a small local database.

slide-4
SLIDE 4

PVG-03-4

Valerio Pascucci

We develop a hybrid approach to generic asynchronous rendering.

When a request is satisfied the image database is updated and a notification is posted to the “done queue.” When an image is not available a request is posted to the “work queue.”

slide-5
SLIDE 5

PVG-03-5

Valerio Pascucci

We develop a hybrid approach to generic asynchronous rendering.

Multiple rendering engines can access the queues at the same time to achieve parallelism.

slide-6
SLIDE 6

PVG-03-6

Valerio Pascucci

We develop a hybrid approach to generic asynchronous rendering.

The queues can be accessed remotely to tackle distributed rendering resources.

slide-7
SLIDE 7

PVG-03-7

Valerio Pascucci

We develop a view-centric decomposition of the scene.

A standard cube is anchored around the view point. The view frustum intersects some of the cube faces.

slide-8
SLIDE 8

PVG-03-8

Valerio Pascucci

Transient artifacts appear after a translation of the point of view.

Rotation and zoom do not invalidate the current images. After a translation the entire image database is invalid but the old images are used until replaced.

slide-9
SLIDE 9

PVG-03-9

Valerio Pascucci

A view-dependent refinement is performed on each cube face.

A pyramidal Kd-tree refinement is performed in image space. A binary tree of tiles of equal resolution is maintained in the image database.

slide-10
SLIDE 10

PVG-03-10

Valerio Pascucci

At each view a Kd-tree refinement determines the new working set.

The refinement determines the new images needed. View 1 View 2

slide-11
SLIDE 11

PVG-03-11

Valerio Pascucci

Horizontal/vertical refinements require simple image stretching.

slide-12
SLIDE 12

PVG-03-12

Valerio Pascucci

Horizontal/vertical refinements require simple image stretching.

The missing images are temporarily extrapolated from those available.

slide-13
SLIDE 13

PVG-03-13

Valerio Pascucci

Front-back refinement requires inverse compositing refinement.

C1 = C2 = C0 / (2- α0) α1 = α2 = 1 - √ 1- α0 C0 = C1 + C2 (1- α0) α0 = α0 + α1 (1- α0)

Level 1 Level 2

slide-14
SLIDE 14

PVG-03-14

Valerio Pascucci

We use two queues to avoid producer-consumer contention.

Tail Head

The display engine does not block the access of the rendering engine.

slide-15
SLIDE 15

PVG-03-15

Valerio Pascucci

Contention among rendering engines is not problematic.

Tail Head

The asynchronous nature of the system and the granularity of the work mitigates contention of rendering engines.

slide-16
SLIDE 16

PVG-03-16

Valerio Pascucci

We tested the scalability of the image cache on two platforms.

SGI Origin 3000, 48 processors (250MHz R10k) Linux cluster, 64 nodes (2.5GHz Pentium) We tested the following parameters of the system: – number of images in the scene – number of rendering servers – size of the images – pixels per second – network bandwidth utilization

slide-17
SLIDE 17

PVG-03-17

Valerio Pascucci

Display speed is inversely proportional to number of Images.

slide-18
SLIDE 18

PVG-03-18

Valerio Pascucci

Fill-rate performance suggest

  • ne particular image size.
slide-19
SLIDE 19

PVG-03-19

Valerio Pascucci

Sustained bandwidth utilization close to ideal pick performance.

slide-20
SLIDE 20

PVG-03-20

Valerio Pascucci

The system scales well with the number of processing units.

slide-21
SLIDE 21

PVG-03-21

Valerio Pascucci

The system scales well with the number of processing units.

slide-22
SLIDE 22

PVG-03-22

Valerio Pascucci

The behavior of the system is consistent across platforms.

slide-23
SLIDE 23

PVG-03-23

Valerio Pascucci

Current directions

Heterogeneous distributed system. Combined multi-resolution representation of the object. Scaling to high resolution output power-walls. Combination with other techniques? Development of prediction agents for data pre-fetching.

slide-24
SLIDE 24

PVG-03-24

Valerio Pascucci

UCRL-PRES-200743

This work was performed under the auspices of the U.S. Department of Energy by University of California Lawrence Livermore National Laboratory under contract No. W-7405-ENG-48.