|
|
|
|
LEADER |
03901nam a2200649 a 4500 |
001 |
3328 |
005 |
20081110172757.0 |
006 |
m||||e|||d|||||||| |
007 |
cr an |||m|||a |
008 |
081017s2006 caua fsb 000 0 eng d |
020 |
# |
# |
|a 9781598291254 (electronic bk.)
|
020 |
# |
# |
|a 1598291254 (electronic bk.)
|
020 |
# |
# |
|a 1598291246 (pbk.)
|
020 |
# |
# |
|a 9781598291247 (pbk.)
|
024 |
7 |
# |
|a 10.2200/S00070ED1V01Y200611CAC002
|2 doi
|
035 |
# |
# |
|a 77563656 (OCLC)
|
035 |
# |
# |
|a (CaBNvSL)gtp00531519
|
040 |
# |
# |
|a CaBNvSL
|c CaBNvSL
|d CaBNvSL
|
050 |
# |
4 |
|a QA76.545
|b .L278 2006
|
082 |
0 |
4 |
|a 005.758
|2 22
|
100 |
1 |
# |
|a Larus, James R.
|
245 |
1 |
0 |
|a Transactional memory
|c James R. Larus and Ravi Rajwar.
|h [electronic resource] /
|
250 |
# |
# |
|a 1st ed.
|
260 |
# |
# |
|a San Rafael, Calif (1537 Fourth Street, San Rafael, CA 94901 USA) :
|b Morgan & Claypool Publishers,
|c 2006.
|
300 |
# |
# |
|a 1 electronic text (xiii, 211 p. : ill.) :
|b digital file.
|
490 |
1 |
# |
|a Synthesis lectures on computer architecture,
|v #2
|x 1935-3243 ;
|
500 |
# |
# |
|a Part of: Synthesis digital library of engineering and computer science.
|
500 |
# |
# |
|a Title from PDF t.p. (viewed on Nov. 7, 2008).
|
500 |
# |
# |
|a Series from website.
|
504 |
# |
# |
|a Includes bibliographical references.
|
505 |
0 |
# |
|a Introduction -- Programming transactional memory -- Software transactional memory -- Hardware-supported transactional memory -- Conclusions.
|
506 |
# |
# |
|a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
|
510 |
0 |
# |
|a Compendex
|
510 |
0 |
# |
|a INSPEC
|
510 |
0 |
# |
|a Google scholar
|
510 |
0 |
# |
|a Google book search
|
520 |
# |
# |
|a The advent of multicore processors has renewed interest in the idea of incorporating transactions into the programming model used to write parallel programs. This approach, known as transactional memory, offers an alternative, and hopefully better, way to coordinate concurrent threads. The ACI (atomicity, consistency, isolation) properties of transactions provide a foundation to ensure that concurrent reads and writes of shared data do not produce inconsistent or incorrect results. At a higher level, a computation wrapped in a transaction executes atomically either it completes successfully and commits its result in its entirety or it aborts. In addition, isolation ensures the transaction produces the same result as if no other transactions were executing concurrently. Although transactions are not a parallel programming panacea, they shift much of the burden of synchronizing and coordinating parallel computations from a programmer to a compiler, runtime system, and hardware. The challenge for the system implementers is to build an efficient transactional memory infrastructure. This book presents an overview of the state of the art in the design and implementation of transactional memory systems, as of early summer 2006.
|
530 |
# |
# |
|a Also available in print.
|
538 |
# |
# |
|a Mode of access: World Wide Web.
|
538 |
# |
# |
|a System requirements: Adobe Acrobat Reader.
|
650 |
# |
0 |
|a Transactional systems (Computer systems)
|
650 |
# |
0 |
|a Threads (Computer programs)
|
650 |
# |
0 |
|a Syncronization.
|
650 |
# |
0 |
|a Parallel programming (Computer science)
|
690 |
# |
# |
|a Transactional memory.
|
690 |
# |
# |
|a Parallel programming concurrent programming.
|
690 |
# |
# |
|a Compilers.
|
690 |
# |
# |
|a Programming languages.
|
690 |
# |
# |
|a Computer architecture.
|
690 |
# |
# |
|a Computer hardware.
|
690 |
# |
# |
|a Wait-free data structures.
|
690 |
# |
# |
|a Cache coherence.
|
690 |
# |
# |
|a Synchronization.
|
700 |
1 |
# |
|a Rajwar, Ravi.
|
730 |
0 |
# |
|a Synthesis digital library of engineering and computer science.
|
830 |
# |
0 |
|a Synthesis lectures on computer architecture (Online) ;
|v #2.
|
856 |
4 |
2 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.2200/S00070ED1V01Y200611CAC002
|3 Abstract with links to full text
|