Skip to main content
SpringerLink
Log in

Prozesse

  • Chapter
  • First Online:
Betriebssysteme

  • 12k Accesses

Zusammenfassung

In früheren Zeiten waren die Rechner zu jedem Zeitpunkt für nur eine Hauptaufgabe bestimmt. Alle Programme wurden zu einem Paket geschnürt und liefen nacheinander durch (Stapelverarbeitung oder Batch-Betrieb). Üblicherweise gibt es heutzutage aber nicht nur ein Programm auf einem Rechner, sondern mehrere (Mehrprogrammbetrieb, multi-tasking). Auch gibt es nicht nur einen Benutzer (single user), sondern mehrere (Mehrbenutzerbetrieb, multi-user).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Literatur

  • Albers, S.: An experimental Study of new and known online packet buffering algorithms. Algorithmica 57:724–746 (2010)

    Article  MathSciNet  Google Scholar 

  • Albers, S.: Energy-efficient algorithms. Commun. ACM 53:(5): 86–96 (2010)

    Article  Google Scholar 

  • Brinch Hansen P.: Structured Multiprogramming. Commun. of the ACM 15(7), 574–578 (1972)

    Article  Google Scholar 

  • Brinch Hansen, P.: Operating System Principles. Prentice Hall, Englewood Cliffs, NJ 1973

    MATH  Google Scholar 

  • Coffman E. G., Elphick M. J., Shoshani A.: System Deadlocks. ACM Computing Surveys 3, 67–78 (1971)

    Article  Google Scholar 

  • Cooling J.: Real-time Operating Systems. Lindentree Associates, 2014

    Google Scholar 

  • Cristian F., Aghili H., Strong R., Dolev D.: Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement. IEEE Proc. FTCS-15, pp. 200–206 (1985)

    MATH  Google Scholar 

  • Dal Cin M., Brause R., Lutz J., Dilger E., Risse Th.: ATTEMPTO: An Experimental Fault-Tolerant Multiprocessor System. Microprocessing and Microprogramming 20, 301–308 (1987)

    Article  Google Scholar 

  • Dijkstra E. W.: Cooperating Sequential Processes, Technical Report (1965). Reprinted in Genuys (ed.): Programming Languages. Academic Press, London 1985

    Google Scholar 

  • Dijkstra E. W.: Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453–457, August 1975

    Article  MathSciNet  Google Scholar 

  • Furht B., Grostick D., Gluch D., Rabbat G., Parker J., McRoberts M.: Real-Time UNIX System Design and Appplication Guide. Kluwer Academic Publishers, Boston 1991

    Book  Google Scholar 

  • Gonzalez, M.: Deterministic Processor Scheduling. ACM Computing Surveys 9(3), 173–204 (1977)

    Article  MathSciNet  Google Scholar 

  • Gottlieb A., Lubachevsky B., Rudolph, L.: Coordinating Large Numbers of Processors. Proc. Int. Conf. on Parallel Processing, 1981

    Google Scholar 

  • Gottlieb A., Grishman R., Kruskal C., McAuliffe K., Rudolph L., Snir M.: The NYU Ultracomputer-Designing an MIMD Shared Memory Parallel Computer. IEEE Transactions on Computers C-32(2), 175–189 (1983)

    Article  Google Scholar 

  • Graham R. L.: Bounds on Multiprocessing Anomalies and Packing Algorithms. Proc. AFIPS Spring Joint Conference 40, AFIPS Press, Montvale, N.J., pp. 205–217 (1972)

    Google Scholar 

  • Habermann A. N.: Prevention of System Deadlocks. Commun. of the ACM 12(7), 373–377, 385 (1969)

    Article  Google Scholar 

  • Hewlett-Packard: How HP-UX Works. Manual B2355-90029, Hewlett Packard Company, Corvallis, OR 1991

    Google Scholar 

  • Hoare C. A. R.: Towards a Theory of Parallel Programming. In Hoare, C. A. R., Perrot, R. H. (Eds): Operating System Techniques. Academic Press, London 1972

    Google Scholar 

  • Hoare C. A. R.: Monitors: An Operating System Structuring Concept. Commun. of the ACM 17(10), 549–557 (1974)

    Article  Google Scholar 

  • Hoare C. A. R.: Communicating Sequential Processes. Commun. of the ACM 21(8), 666–677 (1978), auch unter http://www.usingcsp.com/

    Article  Google Scholar 

  • Holt R. C.: Some Deadlock Properties of Computer Systems. ACM Computing Surveys 4, 179–196 (1972)

    Article  MathSciNet  Google Scholar 

  • IEEE: Threads extension for portable operating systems. P1003.4a, D6 draft, Technical Committee on Operating Systems of the IEEE Computer Society, Report-Nr. ISC/IEC JTC1/SC22/WG15N-P1003, New York, 1992

    Google Scholar 

  • INMOS Ltd.: occam® 2 Reference Manual. Prentice Hall, Englewood Cliffs, NJ 1988

    Google Scholar 

  • Keedy J. L.: On Structuring Operating Systems with Monitors. ACM Operating Systems Rev. 13(1), 5–9 (1979)

    Article  Google Scholar 

  • Lampson B.W., Redell D. D.: Experience with Processes and Monitors in Mesa. Commun. of the ACM 23(2), 105–117 (1980)

    Article  Google Scholar 

  • Laplante Ph.: Real-Time Systems Design and Analysis. IEEE Press 1993

    Google Scholar 

  • Lister A.: The Problem of Nested Monitor Calls. ACM Operating Systems Rev. 11(3), 5–7 (1977)

    Article  Google Scholar 

  • Liu C.L., Layland J.W.: Scheduling Algorithms for Multiprogramming in Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MathSciNet  Google Scholar 

  • Liu J.W.S., Liu C.L.: Performance Analysis of Multiprocessor Systems Containing Functionally Dedicated Processors. Acta Informatica 10(1), 95–104 (1978)

    Article  MathSciNet  Google Scholar 

  • Love R.: Linux Kernel Development, Sams Publ. 2003, ISBN 0-672-32512-8

    Google Scholar 

  • Mattern F.: Verteilte Basisalgorithmen, Informatik-Fachberichte 226, Springer-Verlag Berlin, 1989

    Book  Google Scholar 

  • Maurer C: Grundzüge der Nichtsequentiellen Programmierung, Springer Verlag Berlin Heidelberg 1999

    Book  Google Scholar 

  • Maurer W.: Linux Kernelarchitektur – Konzepte, Strukturen, Algorithmen von Kernel 2.6, Carl Hanser Verlag München, 2004, ISBN 3-446-22566-8

    Google Scholar 

  • Muntz R., Coffman, E.: Optimal Preemptive Scheduling on Two Processor Systems. IEEE Trans. on Computers C-18, 1014–1020 (1969)

    Article  Google Scholar 

  • Northrup Ch.: Programming with Unix Threads. John Wiley & Sons, New York 1996

    Google Scholar 

  • Peterson G. L.: Myths about the Mutual Exclusion Problem. Information Processing Letters 12, 115–116 (1981)

    Article  Google Scholar 

  • Robinson, J.T.: Some Analysis Techniques for Asynchronous Multiprocessor Algorithms. IEEE Trans. on Software Eng. SE-5(1), 24–30 (1979)

    Article  MathSciNet  Google Scholar 

  • Stankovic J., Ramamritham K.: The Spring Kernel: A New Paradigm for Real Time Systems. IEEE Software 8(3), 62–72 (1991)

    Article  Google Scholar 

  • Stankovic J., Spuri M., Ramamritham K., Buttazzo G.: Deadline Scheduling for Real-time Systems, Kluwer Academic Publishers, 1998

    Book  Google Scholar 

  • Teorey T. J., Pinkerton T. B.: A Comparative Analysis of Disk Scheduling Policies. Commun. of the ACM 15(3),177–184 (1972)

    Article  Google Scholar 

  • Wörn H., Brinkschulte U.: Echtzeitsysteme, Springer Verlag, Berlin 2005

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. J.W. Goethe-Universität Frankfurt am Main, Frankfurt, Deutschland

    Rüdiger Brause

Authors
  1. Rüdiger Brause
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Deutschland

About this chapter

Cite this chapter

Brause, R. (2017). Prozesse. In: Betriebssysteme. Springer Vieweg, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54100-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-54100-5_2

  • Published:

  • Publisher Name: Springer Vieweg, Berlin, Heidelberg

  • Print ISBN: 978-3-662-54099-2

  • Online ISBN: 978-3-662-54100-5

  • eBook Packages: Computer Science and Engineering (German Language)

Publish with us

Policies and ethics

Search

Navigation