Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Software support for ordering memory...
~
Fang, Xing.
Linked to FindBook
Google Book
Amazon
博客來
Software support for ordering memory operations in parallel systems.
Record Type:
Language materials, printed : Monograph/item
Title/Author:
Software support for ordering memory operations in parallel systems./
Author:
Fang, Xing.
Description:
115 p.
Notes:
Source: Dissertation Abstracts International, Volume: 74-03(E), Section: B.
Contained By:
Dissertation Abstracts International74-03B(E).
Subject:
Engineering, Computer. -
Online resource:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3544135
ISBN:
9781267738073
Software support for ordering memory operations in parallel systems.
Fang, Xing.
Software support for ordering memory operations in parallel systems.
- 115 p.
Source: Dissertation Abstracts International, Volume: 74-03(E), Section: B.
Thesis (Ph.D.)--Purdue University, 2012.
Parallel processing is essential to exploiting the potential of multi-core processors. Correct and efficient programming for parallel machines is a notoriously difficult job done well by only a few select, well-trained programmers. However, parallel platforms are becoming ubiquitous, requiring far more programs to be written by regular programmers. This motivates the implementation of new parallel programming paradigms that are efficient and easy to reason about and use.
ISBN: 9781267738073Subjects--Topical Terms:
1669061
Engineering, Computer.
Software support for ordering memory operations in parallel systems.
LDR
:03592nam 2200349 4500
001
1957322
005
20131202131334.5
008
150210s2012 ||||||||||||||||| ||eng d
020
$a
9781267738073
035
$a
(UMI)AAI3544135
035
$a
AAI3544135
040
$a
UMI
$c
UMI
100
1
$a
Fang, Xing.
$3
2092199
245
1 0
$a
Software support for ordering memory operations in parallel systems.
300
$a
115 p.
500
$a
Source: Dissertation Abstracts International, Volume: 74-03(E), Section: B.
500
$a
Adviser: Samuel P. Midkiff.
502
$a
Thesis (Ph.D.)--Purdue University, 2012.
520
$a
Parallel processing is essential to exploiting the potential of multi-core processors. Correct and efficient programming for parallel machines is a notoriously difficult job done well by only a few select, well-trained programmers. However, parallel platforms are becoming ubiquitous, requiring far more programs to be written by regular programmers. This motivates the implementation of new parallel programming paradigms that are efficient and easy to reason about and use.
520
$a
Modern processors implement relaxed memory models when used as part of a shared memory system, that is, one where loads and stores that do not reference the same memory location are allowed to execute in a different order than they appear in the program. Programming languages implement memory (or consistency) models that require other memory references to be executed in order, beyond those guaranteed to execute in order by the relaxed consistency model processor, i.e., they have a stricter memory model. An extreme example of a stricter memory model is the sequentially consistent memory model. A stricter model is thought by many to be easier to reason about than a relaxed model.
520
$a
Current processors provide fence instructions that allow these stricter orders to be enforced. We present a flow-based fence insertion algorithm for effectively enforcing the orders required. This algorithm is implemented in the Pensieve-Jikes compiler. Data showing the effectiveness of the algorithm is provided.
520
$a
New architectures have been proposed that aim to support high performance sequential consistency by committing groups of instructions (chunks) at one time. Aggressive compiler support is required to break programs into reasonable sized groups at strategic places, attaining a high-performance sequentially consistent environment. In the second half of this dissertation we present in detail a compiler algorithm and implementation that performs full-program automatic formation of chunks for such a blocked architecture. We show, for the first time, that fully automatic techniques with no programmer intervention provide a sequentially-consistent system that has a higher performance than conventional machines with relaxed memory models. For 8 full Java codes, we show that compiler generated code running on a simulated 4-processor blocked architecture and supporting sequential consistency, runs on average 5% faster than code on a conventional architecture supporting the more relaxed Java memory model.
590
$a
School code: 0183.
650
4
$a
Engineering, Computer.
$3
1669061
690
$a
0464
710
2
$a
Purdue University.
$b
Electrical and Computer Engineering.
$3
1018497
773
0
$t
Dissertation Abstracts International
$g
74-03B(E).
790
1 0
$a
Midkiff, Samuel P.,
$e
advisor
790
1 0
$a
Midkiff, Samuel P.
$e
committee member
790
1 0
$a
Eigenmann, Rudolf
$e
committee member
790
1 0
$a
Vijaykumar, T. N.
$e
committee member
790
1 0
$a
Pai, Vijay S.
$e
committee member
790
$a
0183
791
$a
Ph.D.
792
$a
2012
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3544135
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9252153
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login