Skip to main content

Parallele Speicherverwaltung für Einen Graphischen Arbeitsplatzrechner

  • Conference paper
GI/OCG/ÖGI-Jahrestagung 1985

Part of the book series: Informatik Fachberichte ((INFORMATIK,volume 108))

  • 119 Accesses

Zusammenfassung

Die Entwicklung von graphischen Arbeitsplatzrechnern wird in zunehmendem Maße von zwei sich gegenseitig ergänzenden Trends dominiert: Der Migration von Funktionen in Firmware und spezielle Hardware, und der Parallelisierung von Funktionsausführung. Komponenten der graphischen Darstellungsreihe wie Koordinatentransformation, Klippen, Kreisgenerierung und Polygon-Füllung waren erwartungsgemäß unter den ersten Kandidaten für eine Realisierung in Silikon (9). Parallelität auf dem Arbeitsplatz- rechner existiert bereits als MISD — Transformation, Klippen und Skalieren auf der Geometry Engine Pipeline (5), SIMD — RasterOp auf dem DisArray (21), und in Ansätzen MIMD — in einem Modell, das graphische Darstellungsreihen in unabhängige, konfigurierbare Prozesse zerlegt (2).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Adel’son-Velskii, G. M. and Landis, E. M. An Algorithm of Information Arrangement. In: Dokl. Akad. Nauk USSR, Vol. 146, 2, 1962, 263–266.

    Google Scholar 

  2. Arnold, D., Hall, G., and Reynolds, G. Proposals for Configurable Models of Graphics Systems. Computer Graphics Forum 3, 3 (Sept. 1984), 201–208.

    Article  Google Scholar 

  3. Baker. H.G. Jr. List Processing in Real-Time on a Serial Computer. Comm.ÀCM 21, 4 (April 1978), 280–294.

    Google Scholar 

  4. Chin, J., Duffy, C., Hertzing. B.; Porterfield. J., and Vecchiet, K. VDI Segment instructions. ANSI X3K3/84–46, March Ì984.

    Google Scholar 

  5. Clark, J.H. The Geometry Engine: A VLSI Geometry System for Graphics. Computer Graphics 16, 3 (July 1982), 127–133.

    Article  Google Scholar 

  6. Cohen, J. Garbage Collection of Linked Data Structures. Computing Surveys 13, 3 (Sept. 1981), 341–367.

    Article  MathSciNet  Google Scholar 

  7. Dawson, J.L. Improved Effectiveness from a Real-Time Lisp Garbage Collector. In: Conf. Record of the 1982 ACM Symp. on LISP and Functional Programming, ACM, 1982, 159–167.

    Google Scholar 

  8. Dijkstra, E. W., Lamport, L., Martin, A.J., Scholten, C.S., and Steffens, E.F.M. On-the-Fly Garbage Collection: An Exercise in Cooperation, In: Lecture Notes in Computer Science, Vol. 46, Springer Verlag, New York, 1976, 43–56.

    Google Scholar 

  9. Encarnacao. J.L.. Lindner, R.. Mehl. M.. Pfaff. G., and Stra$ser. W. A VLSI Implementati on of the Graphics Standard GKS. Computer Graphics Forum 2, 2 /3 (Aug. 1983), 115–121.

    Article  Google Scholar 

  10. Draft International Standard ISO/DIS 7942, Information Processing Graphical Kernel System (GKS), Functional Description, Version 7.2, NI-5.9/1–83, Nov. 1982.

    Google Scholar 

  11. Halstead, R.H. Jr. Implementation of Multilisp: Lisp on a Multiprocessor. In: Conf. Record of the 1984 ACM Symp. on LISP and Functional Programming, ACM, 1984, 9–17.

    Google Scholar 

  12. Hertzing, B.. Chin. J., Duffy, C.. and Porterfield, J. A Segmentation Model for VDI. ANSI X3H3/84-48, Feß. 1984.

    Google Scholar 

  13. Hickey, T., and Cohen, J. Performance Analysis of On-the-Fly Garbage Collection. Comm. ACM 27, 11 (Nov. 1984), 1143–1154.

    Article  Google Scholar 

  14. Hudak, P., and Keller, R.M. Garbage Collection and Task Deletion in Distributed Applicative Processing Systems. In: Conf. Record of the 1982 ACM Symp. on LISP and Functional Programming, ACM, 1982, 168–178.

    Google Scholar 

  15. Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  16. Kung, H.T., and Song, S.W. An Efficient Parallel Garbage Collection System and its Correctness Proof. Dept. of Comp.Sci. Rep., Carnegie-Mellon Univ., Pa., Sept. 1977.

    Google Scholar 

  17. Leich, H., Levchanovsky, F.V., and Prikhodko, V.I. A Multi-Microprocessor Based Intelligent Graphics Terminal. Microprocessing and Microprogramming 12 (1983), 175– 180.

    Article  Google Scholar 

  18. Liebermann, H., and Hewitt, C. A Real-Time Garbage Collector Based on the Lifetimes of Objects. Comm. ACM 26, 6 (June 1983), 419–429.

    Article  Google Scholar 

  19. Moon. D.A. Garbage Collection in a Large Lisp System. In: Conf. Record of the 1984 ACM Symp. on LISP and Functional Programming, ACM, 1984, 235–246.

    Google Scholar 

  20. Nielsen. N.R. Dynamic Memory Allocation in Computer Simulation. Comm.ACM 20, 11 (Nov. 1977), 864–873.

    Article  Google Scholar 

  21. Page, I. DisArray: A 16x16 Rasterop Processor. In: Proc. Eurographics ’83, P.J.W.ten Hagen ( Ed. ), North-Holland Pub., 1983, 367–381.

    Google Scholar 

  22. Pollack, F.J., Cox, G.W., Hammerstrom, D.W., Kahn, K.C.. Lai, K.K., and Rattner, J.R. Supporting Ada Memory Management in the iAPX-432. In: Proc. of Symp. on Architectural Support for Programming Languages and Operating Systems, ACM SIGARCH Computer Architecture News 10, 2 (March 1982) and ACM S1GPLAN Notices 17, 4 (April 1982 ), 117–131.

    Google Scholar 

  23. Functional Specification of the Programmer’s Hierarchical Interactive Graphics System (PHIGS). ANSI X3H31/84–40, 1984.

    Google Scholar 

  24. Rudalics. M. Software Issues as Related to the Arithmetics Processing Capabilities of an Intelligent Graphics Terminal. In: Proc. of Conf. on Computer Graphics, Bratislava, 1983, 152–157.

    Google Scholar 

  25. Steele. G.L. Jr. Multiprocessing Compactifying Garbage Collection. Comm.ACM 18, 9 (Sept. 1975), 495–508.

    Article  MATH  Google Scholar 

  26. Steele. G.L. Jr., and Sussmann. G.J. Design of a LISP-Based Microprocessor. Comm.ACM 23, 11 (Nov. 1980), 628–645.

    Article  Google Scholar 

  27. Steinhart, J.E. Proposal for GKS Output Level 3 — Segment Hierarchy and Editing. ANSI X3H3/84-57R1 and Computer Graphics Forum 3, 4 (Dec. 1984), 289–297.

    Article  Google Scholar 

  28. Ungar, D. Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm. In: Proc. of ACM SIGSOFT/SIGPLAN Software Engineering Symp. on Practical Software Development Environments. P.Henderson (Ed.), Software Engineering Notes 9, 3 (May 1984) and SIGPLAN Notices 19, 5 (May 1984), 157–167.

    Chapter  Google Scholar 

  29. Preliminary Draft of the Virtual Device Interface (VDI). ANSI X3H33, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linemayr, I., Rudalics, M. (1985). Parallele Speicherverwaltung für Einen Graphischen Arbeitsplatzrechner. In: Hansen, H.R. (eds) GI/OCG/ÖGI-Jahrestagung 1985. Informatik Fachberichte, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-70639-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-70639-4_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15697-0

  • Online ISBN: 978-3-642-70639-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics