東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Reducing time and space costs of mem...

Gao, Xiaofeng.

Linked to FindBook

Google Book

Amazon

博客來

Reducing time and space costs of memory tracing.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Reducing time and space costs of memory tracing./
Author:	Gao, Xiaofeng.
Description:	150 p.
Notes:	Source: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0354.
Contained By:	Dissertation Abstracts International67-01B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3204837
ISBN:	9780542507069

Reducing time and space costs of memory tracing.
Gao, Xiaofeng.

Reducing time and space costs of memory tracing. - 150 p.

Source: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0354.

Thesis (Ph.D.)--University of California, San Diego, 2006.

Event tracing of applications under dynamic execution is crucial for performance modeling, optimization and trace-driven simulations. However, collecting and processing events, especially memory addresses, is extremely expensive in terms of time and space requirements. It is also challenging to find the right platform and the right tools to perform tracing. Such challenges greatly hinder the feasibility of tracing memory of large, long running, parallel applications.

ISBN: 9780542507069Subjects--Topical Terms:

626642
Computer Science.

Reducing time and space costs of memory tracing.
LDR:03198nmm 2200325 4500 001 1825460
005 20061211074636.5
008 130610s2006 eng d
020 $a 9780542507069
035 $a (UnM)AAI3204837
035 $a AAI3204837
040 $a UnM $c UnM
100 1 $a Gao, Xiaofeng. $3 1684473
245 1 0 $a Reducing time and space costs of memory tracing.
300 $a 150 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0354.
500 $a Co-Advisers: Allan Snavely; Larry Carter.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2006.
520 $a Event tracing of applications under dynamic execution is crucial for performance modeling, optimization and trace-driven simulations. However, collecting and processing events, especially memory addresses, is extremely expensive in terms of time and space requirements. It is also challenging to find the right platform and the right tools to perform tracing. Such challenges greatly hinder the feasibility of tracing memory of large, long running, parallel applications.
520 $a In this thesis, the challenges in tracing memory are explored and several solutions are exhibited to face each challenge. The philosophy of these solutions, schemes and workarounds is to find balance in the time and space on available platforms with available tools.
520 $a Specifically, the time required to acquire memory traces can be greatly reduced by carefully identifying all causes of slowdown and addressing them in the design of built-for-the-purpose tracers. Techniques, including buffering, chaining and delayed instrumentation, are introduced and have been shown to reduce the time cost of memory tracing by more than 80% when used with traditional instrumentation tools. In addition, a lightweight instrumentation tool ALITER, which only causes two-fold slowdown in collecting full memory traces, is introduced to demonstrate the benefits of asynchronous tracing schemes.
520 $a Path grammar guided trace compression and trace approximation are explored in this thesis to reduce space costs of memory tracing. The efficacy of low-level general purpose compression schemes is greatly enhanced when they are organized around information about program structure and phases; combined with trace recording designed to capture the locality properties of random events, not the exact random events themselves, space required to store traces can be reduced by many orders of magnitude. These techniques enable one to generate reusable intermediate representations of memory traces, which are small enough to be stored on the disk, accurate enough for trace-driven simulations and fast enough to collect and process.
520 $a Together with working through practical issues of availability, these advances make trace-driven simulation of full scale HPC applications feasible.
590 $a School code: 0033.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of California, San Diego. $3 1018093
773 0 $t Dissertation Abstracts International $g 67-01B.
790 1 0 $a Snavely, Allan, $e advisor
790 1 0 $a Carter, Larry, $e advisor
790 $a 0033
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3204837