000 04993nam a2201237 i 4500
001 5259924
003 IEEE
005 20220712205622.0
006 m o d
007 cr |n|||||||||
008 151221s2005 njua ob 001 eng d
020 _a9780471721277
_qelectronic
020 _z9780471432302
_qprint
020 _z0471721271
_qelectronic
024 7 _a10.1002/0471721271
_2doi
035 _a(CaBNVSL)mat05259924
035 _a(IDAMS)0b000064810bf4f1
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aQA76.58
_b.G35 2004eb
082 0 4 _a005.2/75
_222
100 1 _aGarg, Vijay K.
_q(Vijay Kumar),
_d1963-
_926544
245 1 0 _aConcurrent and distributed computing in Java /
_cVijay K. Garg.
264 1 _a[Piscataway, New Jersey?] :
_bIEEE Press,
_cc2004.
264 2 _a[Piscataqay, New Jersey] :
_bIEEE Xplore,
_c[2005]
300 _a1 PDF (xx, 309 pages) :
_billustrations.
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
504 _aIncludes bibliographical references (p. 297-304) and index.
505 0 _aMutual exclusion problem -- Synchronization primitives -- Consistency conditions -- Wait-free synchronization -- Distributed programming -- Models and clocks -- Resource allocation -- Global snapshot -- Global properties -- Detecting termination and deadlocks -- Message ordering -- Leader election -- Synchronizers -- Agreement -- Transactions -- Recovery -- Self-stabilization.
506 1 _aRestricted to subscribers or individual electronic text purchasers.
520 _aConcurrent and Distributed Computing in Java addresses fundamental concepts in concurrent computing with Java examples. The book consists of two parts. The first part deals with techniques for programming in shared-memory based systems. The book covers concepts in Java such as threads, synchronized methods, waits, and notify to expose students to basic concepts for multi-threaded programming. It also includes algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures. The second part of the book deals with programming in a message-passing system. This part covers resource allocation problems, logical clocks, global property detection, leader election, message ordering, agreement algorithms, checkpointing, and message logging. Primarily a textbook for upper-level undergraduates and graduate students, this thorough treatment will also be of interest to professional programmers.
530 _aAlso available in print.
538 _aMode of access: World Wide Web
588 _aDescription based on PDF viewed 12/21/2015.
650 0 _aParallel processing (Electronic computers)
_926545
650 0 _aElectronic data processing
_xDistributed processing.
_93666
650 0 _aJava (Computer program language)
_93829
655 0 _aElectronic books.
_93294
695 _aAlgorithm design and analysis
695 _aArrays
695 _aBibliographies
695 _aBiological system modeling
695 _aBirds
695 _aBooks
695 _aCameras
695 _aCheckpointing
695 _aClocks
695 _aColor
695 _aCommunication networks
695 _aCommunication systems
695 _aComplexity theory
695 _aComputational modeling
695 _aComputer crashes
695 _aComputer networks
695 _aConcurrency control
695 _aConcurrent computing
695 _aData structures
695 _aDelay
695 _aDistributed algorithms
695 _aDistributed databases
695 _aFault tolerance
695 _aFault tolerant systems
695 _aFloods
695 _aGreen products
695 _aHardware
695 _aHip
695 _aHistory
695 _aIP networks
695 _aImage color analysis
695 _aImage edge detection
695 _aIndexes
695 _aInstruction sets
695 _aInternet
695 _aJava
695 _aLaw
695 _aLead
695 _aMessage systems
695 _aMonitoring
695 _aNominations and elections
695 _aOptimization
695 _aOut of order
695 _aProgramming
695 _aProtocols
695 _aReal time systems
695 _aReceivers
695 _aRegisters
695 _aResource management
695 _aSchedules
695 _aSections
695 _aSemantics
695 _aServers
695 _aSilicon
695 _aSleep
695 _aSockets
695 _aSynchronization
695 _aSystem recovery
695 _aTesting
695 _aTopology
695 _aUpper bound
710 2 _aJohn Wiley & Sons,
_epublisher.
_96902
710 2 _aIEEE Xplore (Online service),
_edistributor.
_926546
776 0 8 _iPrint version:
_z9780471432302
856 4 2 _3Abstract with links to resource
_uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=5259924
942 _cEBK
999 _c73807
_d73807