G. Voß
ABSTRACT
One of the main shortcomings of current scene graphs is their inability to support multi-thread safe data structures. This work describes the general framework used by the OpenSG scene graph system to enable multiple concurrent threads to independently manipulate the scene graph without interfering with each other. Furthermore the extensions of the presented mechanisms needed to support cluster systems are discussed.
- P. S. Strauss and R. Carey. An object-oriented 3D graphics toolkit. ACM Computer Graphics (Proc. of SIGGRAPH '92), 341-349, 1992. Google Scholar
Digital Library
- sgi. Unleashing the power of sgi's next generation visualization technology. http://www.sgi.com/software/optimizer/whitepaper.html, 2001.Google Scholar
- J. Rohlf and J. Helman. IRIS Performer: A high performance toolkit for real-time 3D graphics. ACM Computer Graphics (Proc. of SIGGRAPH '94), 381-395, 1994. Google ScholarDigital Library
- sgi. OpenGL Performer Programmer's Guide. www.cineca.it/manuali/Performer/ProgGuide24/html/Perf_PG-18.html, 2000.Google Scholar
- K, Diefendorff. Power4 Focuses on Memory Bandwith. Microprocessor Report,13(14), 1999.Google Scholar
- D. Reiners, G. Voß, J. Behr. OpenSG: Basic Concepts. www.opensg.org/OpenSGPLUS/symposium/Papers2002, 2002.Google Scholar
- sgi. Standard Template Library Programmer's Guide www.sgi.com/tech/stl, 2002Google Scholar
- International Standard ISO/IEC 14772-1:1997. Information technology --- Computer graphics and image processing --- The Virtual Reality Modeling Language (VRML) --- Part 1: Functional specification and UTF-8 encoding, 1997.Google Scholar
Index Terms
- A multi-thread safe foundation for scene graphs and its extension to clusters
Recommendations
An extension of regular supermagic graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we consider ...
Cycle extension in edge-colored complete graphs
Let G be an edge-colored graph. The minimum color degree of G is the minimum number of different colors appearing on the edges incident with the vertices of G. In this paper, we study the existence of properly edge-colored cycles in (not necessarily ...
Thread contracts for safe parallelism
PPoPP '11We build a framework of thread contracts, called Accord, that allows programmers to annotate their concurrency co-ordination strategies. Accord annotations allow programmers to declaratively specify the parts of memory that a thread may read or write ...
Comments