Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Concurrent programming
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Concurrent programming

Concurrent programming

The Java programming language

Stephen J. Hartley

272 pages, parution le 04/06/1998

Résumé

This text shows professional programmers and students in operating systems and concurrent programming classes how to utilize the Java programming language to write programs that use semaphores, monitors, message passing, remote procedure calls, and the rendezvous for thread synchronization and communication. A Java algorithm animation package is also described. A web site supporting this text has been set up at http://www.mcs.drexel.edu/~shartley/ConcProgJava/index.html. It includes information on retrieving example programs and errata for the book.

Summary of contents

  • Hardware and software concepts: processes
  • threads
  • CPU scheduling and context switching
  • hardware protection
  • Part 2 The Java programming language: sequential features
  • single-class static programs
  • multi-class static programs
  • objects
  • command line argument parsing
  • inheritance
  • interfaces
  • user-defined exceptions
  • packages
  • mathematical functions
  • genetic algorithms
  • animating programs with Java's AWT
  • exercises
  • Part 3 Concurrent programming: Java threads
  • thread states and scheduling
  • other thread methods
  • why use threads'
  • debugging techniques
  • race conditions and thread synchronization
  • memory system behaviour
  • thread priorities and starvation
  • the mutual exclusion problem
  • software solutions for two threads
  • software solutions for more than two threads
  • hardware solutions
  • blocking solutions
  • exercises
  • Part 4 Semaphores: definitions and implementation
  • Java semaphores
  • binary semaphores
  • counting semaphores
  • classical operating systems problems
  • semaphore solutions
  • the bounded buffer producer and consumer
  • using bounded buffers
  • the sleeping barber
  • the dining philosophers
  • the readers and writers
  • deadlock
  • counting semaphores from binary
  • animating operating systems algorithms
  • exercises
  • Part 5 Monitors: definitions
  • signal and exit
  • the bounded buffer producer and consumer
  • the dining philosphers
  • the readers and writers
  • signal and continue
  • Java monitors
  • the bounded buffer producer and consumer
  • the dining philosophers
  • the readers and writers
  • deadlock
  • binary and counting semaphore monitors
  • locks
  • notification objects
  • implementing monitors with semaphores
  • named condition variables for Java
  • algorithm animation
  • exercises
  • Part 6 Message passing and the rendezvous: message passing definitions
  • message passing in Java
  • synchronization using message passing
  • distributed mutual exclusion
  • conditional message passing
  • the distributed dining philosophers
  • rendezvous
  • conditional rendezvous
  • remote method invocation
  • more animation with Java
  • exercises
  • Part 7 Parallel Computing: definitions
  • data parallel message passing
  • worker crew message passing
  • shared memory parallelism
  • patterns of communication
  • exercises

L'auteur - Stephen J. Hartley

Autres livres de Stephen J. Hartley

Caractéristiques techniques

  PAPIER
Éditeur(s) Oxford University Press
Auteur(s) Stephen J. Hartley
Parution 04/06/1998
Nb. de pages 272
Format 230 x 150
EAN13 9780195113150

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription