5 research outputs found

    ๋ฐฑ์„œ ๋‡Œ์ถœํ˜ˆ ๋ชจ๋ธ์—์„œ geranylgeranylacetone์˜ ์น˜๋ฃŒ ํšจ๊ณผ์™€ ์—ด์ถฉ๊ฒฉ ๋‹จ๋ฐฑ์งˆ 70 ํ™œ์„ฑํ™”์— ๋ฏธ์น˜๋Š” ์˜ํ–ฅ์— ๋Œ€ํ•œ ์—ฐ๊ตฌ

    No full text
    ํ•™์œ„๋…ผ๋ฌธ(์„์‚ฌ) --์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› :์˜ํ•™๊ณผ ๋‡Œ์‹ ๊ฒฝ๊ณผํ•™ ์ „๊ณต,2007.Maste

    ๊ณ„์ธต๊ฐ„ ์ •๋ณด ๊ณต์œ ๋ฅผ ํ†ตํ•œ ๋””์Šคํฌ ์ž…์ถœ๋ ฅ ํšจ์œจ์„ฑ ํ–ฅ์ƒ

    No full text
    ๋น ๋ฅธ ์ €์žฅ๊ณผ ์ •๋ณด ๊ฒ€์ƒ‰ ํ˜„๋Œ€ ์ปดํ“จํŒ… ์‹œ์Šคํ…œ์ด ํ’€์–ด์•ผ ํ•  ํ•ต์‹ฌ ๊ณผ์ œ ์ค‘ ํ•˜๋‚˜์ด๋‹ค. ์ง€๋‚œ ์ˆ˜์‹ญ ๋…„ ๋™์•ˆ ๋Œ€ํ‘œ์ ์ธ ๋ณด์กฐ ์ €์žฅ ์žฅ์น˜์˜€๋˜ ๋งˆ๊ทธ๋„คํ‹ฑ ํ•˜๋“œ ๋””์Šคํฌ ๋“œ๋ผ์ด๋ธŒ๋Š” ๋งˆ์ดํฌ๋กœ ํ”„๋กœ์„ธ์„œ ๋ฐ ๋ฉ”๋ชจ๋ฆฌ์™€์˜ ์„ฑ๋Šฅ ๊ฒฉ์ฐจ ์ฆ๊ฐ€๋กœ ์ธํ•ด ์ „์ฒด ์‹œ์Šคํ…œ์˜ ์ฃผ์š”ํ•œ ์„ฑ๋Šฅ ๋ณ‘๋ชฉ ๋Œ€์ƒ์ด ๋˜์—ˆ๋‹ค. ์ด๋Ÿฌํ•œ ์„ฑ๋Šฅ ๊ฒฉ์ฐจ๋ฅผ ์™„ํ™”ํ•˜๊ธฐ ์œ„ํ•ด์„œ ๊ธฐ์กด ์Šคํ† ๋ฆฌ์ง€ ์Šคํƒ์€ ๊ธธ๊ณ  ๋ณต์žกํ•˜๊ฒŒ ์ง„ํ™”ํ•˜์˜€๋‹ค. ํ˜„๋Œ€ ์Šคํ† ๋ฆฌ์ง€ ์‹œ์Šคํ…œ์˜ ๊ณ„์ธต์ ์ธ ๋””์ž์ธ์€ ๊ทธ๋Ÿฌ๋‚˜ ์ •๋ณด ์€ํ๋ผ๋Š” ๊ทผ๋ณธ์ ์ธ ๋ฌธ์ œ์ ์„ ์•ˆ๊ณ  ์žˆ๋‹ค. ํ˜„๋Œ€ ์Šคํ† ๋ฆฌ์ง€ ์‹œ์Šคํ…œ์˜ ์ข๊ณ  ๋‹จ์ˆœํ•œ ์ธํ„ฐํŽ˜์ด์Šค๋Š” ํ•„์—ฐ์ ์œผ๋กœ ๊ฐ ๊ณ„์ธต์ด ๊ฐ€์ง€๊ณ  ์žˆ๋Š” ๋งŽ์€ ์ •๋ณด๋“ค์„ ์ˆจ๊ธด๋‹ค. ๊ทธ ๊ฒฐ๊ณผ, ์ •๋ณด ์€ํ๋Š” ๋””์Šคํฌ ๋“œ๋ผ์ด๋ธŒ์˜ ๋ณด๋‹ค ํšจ์œจ์ ์ธ ์‚ฌ์šฉ์„ ์ €ํ•ดํ•  ๊ฐ€๋Šฅ์„ฑ์ด ๋†’๊ฒŒ ๋œ๋‹ค. ์šฐ๋ฆฌ๋Š” ๊ณ„์ธต๋ณ„ ์ •๋ณด์˜ ๊ณต์œ ๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœ ์Šคํ† ๋ฆฌ์ง€ ์‹œ์Šคํ…œ์—์„œ์˜ ํ˜‘์—…์ด ๋””์Šคํฌ ์ž…์ถœ๋ ฅ ํšจ์œจ์„ฑ์„ ๊ฐœ์„ ํ•˜๋Š”๋ฐ ๋„์›€์ด ๋  ๊ฒƒ์œผ๋กœ ๋ฏฟ๋Š”๋‹ค. ๋ณธ ํ•™์œ„ ๋…ผ๋ฌธ์—์„œ๋Š” ๋””์Šคํฌ ์ž…์ถœ๋ ฅ ์‹œ์Šคํ…œ์—์„œ์˜ ์ •๋ณด ๊ณต์œ ์˜ ํ•„์š”์„ฑ๊ณผ ์žฅ์ ์„ ์—ฐ๊ตฌํ•œ๋‹ค. ์šฐ๋ฆฌ๋Š” ์šฐ์„ ์ ์œผ๋กœ ์–ด๋– ํ•œ ์ •๋ณด๊ฐ€ ๊ณ„์ธต๊ฐ„์— ๊ณต์œ ๋˜์–ด์•ผ ํ• ์ง€์— ๋Œ€ํ•ด ์ดˆ์ ์„ ๋งž์ถ˜๋‹ค. ์šฐ๋ฆฌ๋Š” ํ˜„๋Œ€ ๋””์Šคํฌ ๋“œ๋ผ์ด๋ธŒ์˜ ์„ธ๋ถ€์ ์ธ ๋ฉ”์ปค๋‹ˆ์ฆ˜์„ ๋ถ„์„ํ•˜์—ฌ ์šด์˜์ฒด์ œ์™€ ์ €์žฅ ์žฅ์น˜ ์‚ฌ์ด์˜ ์˜๋ฏธ๋ก ์ ์ธ ์ฐจ์ด (semantic gap)์ด ์กด์žฌํ•จ์„ ๋ฐํžŒ๋‹ค. ์ด๋ฅผ ์œ„ํ•ด์„œ ์šฐ๋ฆฌ๋Š” ํ˜„๋Œ€ ๋””์Šคํฌ ๋“œ๋ผ์ด๋ธŒ์˜ ์ €์ˆ˜์ค€ ์ •๋ณด๋ฅผ ์ถ”์ถœํ•  ์ˆ˜ ์žˆ๋Š” ์†Œํ”„ํŠธ์›จ์–ด ๋„๊ตฌ๋ฅผ ์„ค๊ณ„ ๋ฐ ๊ตฌํ˜„ํ•œ๋‹ค. ๋™์‹œ ๊ฐฑ์‹  ์บ์‹ฑ (write-through caching) ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ ๋””์Šคํฌ์—์„œ์˜ ์˜๋ฏธ๋ก ์ ์ธ ์ฐจ์ด์˜ ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด์„œ, ์šฐ๋ฆฌ๋Š” ์š”์ฒญ ์ธํ„ฐ๋ฆฌ๋น™ (request interleaving) ์ด๋ผ๋Š” ๋ธ”๋ก ๊ณ„์ธต์˜ ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ๋ณธ ๊ธฐ๋ฒ•์€ ์šด์˜์ฒด์ œ์˜ ์ž…์ถœ๋ ฅ ์Šค์ผ€์ค„๋ง ๊ฒฐ์ •์— ๋””์Šคํฌ์˜ ์ €์ˆ˜์ค€ ์ •๋ณด๋ฅผ ๋ฐ˜์˜ํ•˜์—ฌ ๋™์‹œ ๊ฐฑ์‹  ์บ์‹ฑ ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ ๋””์Šคํฌ์—์„œ ๊ด€์ฐฐ๋˜๋Š” ๊ธด ์ง€์—ฐ ์‹œ๊ฐ„์„ ํ”ผํ•˜๋„๋ก ๊ทผ์ ‘ ๊ฑฐ๋ฆฌ์˜ ์“ฐ๊ธฐ ์š”์ฒญ๋“ค์„ ์žฌ๋ฐฐ์น˜ ํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ์šฐ๋ฆฌ๋Š” ๋˜ํ•œ ๊ณ„์ธต๊ฐ„ ์ •๋ณด ๊ณต์œ ๋ฅผ ํ™œ์šฉํ•˜์—ฌ ๊ธฐ์กด ์ €์žฅ์†Œ ์‹œ์Šคํ…œ์— ์ ์šฉ๋œ ์ž…์ถœ๋ ฅ ์ตœ์ ํ™” ๊ธฐ์ˆ ์„ ๊ฐ•ํ™”ํ•˜๋Š” ๋ฐฉ๋ฒ•์„ ์—ฐ๊ตฌํ•œ๋‹ค. ํŒŒ์ผ ์‹œ์Šคํ…œ์ด ์œ ์ง€ํ•˜๋Š” ๋ธ”๋ก ์ƒ์กด (block liveness) ์ •๋ณด๋ฅผ ํ†ตํ•ด์„œ ๋น„์—ฐ์†์ ์ธ ์š”์ฒญ์„ ๋ณ‘ํ•ฉํ•  ์ˆ˜ ์žˆ๋„๋ก ๊ธฐ์กด์˜ ์š”์ฒญ ๋ณ‘ํ•ฉ (request merging) ๊ธฐ๋ฒ•์˜ ์ ์šฉ ๋ฒ”์œ„๋ฅผ ํ™•์žฅํ•œ๋‹ค. ์šฐ๋ฆฌ๋Š” ์ด๋Ÿฌํ•œ ๊ธฐ๋ฒ•์„ ์š”์ฒญ ๋ธŒ๋ฆฌ์ง• (request bridging)์ด๋ผ ์ผ์ปซ๋Š”๋‹ค. ์ด ๊ธฐ๋ฒ•์„ ํ†ตํ•ด์„œ ์šฐ๋ฆฌ๋Š” ๋ถˆ์—ฐ์†์ ์ธ ์—ฌ๋Ÿฌ ์“ฐ๊ธฐ ์š”์ฒญ๋“ค์„ ๋” ํฐ ์š”์ฒญ๋“ค๋กœ ๋ณ‘ํ•ฉํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ํ•˜๋‚˜์˜ ์ž…์ถœ๋ ฅ ์š”์ฒญ์ด ๋‹ด๊ณ  ์žˆ๋Š” ๋ฐ์ดํ„ฐ์˜ ํฌ๊ธฐ๋ฅผ ๋Š˜๋ฆผ์œผ๋กœ์„œ ๋””์Šคํฌ์˜ ์ž…์ถœ๋ ฅ ์ง€์—ฐ์‹œ๊ฐ„์„ ๋ถ„ํ•  ์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค. ์šฐ๋ฆฌ์˜ ์„ฑ๋Šฅ ํ‰๊ฐ€๋Š” ๋ณ‘๋ ฌ ์ž…์ถœ๋ ฅ ์‘์šฉ ํ”„๋กœ๊ทธ๋žจ์—์„œ ์šฐ๋ฆฌ์˜ ๊ธฐ๋ฒ•์ด ์ƒ๋‹นํ•œ ์„ฑ๋Šฅ์˜ ํ–ฅ์ƒ์„ ๊ฐ€์ ธ์˜จ๋‹ค๋Š” ๊ฒƒ์„ ๋ณด์—ฌ์ฃผ๊ณ , ๋™์‹œ์— ์ฒ˜๋ฆฌ๋˜๋Š” ์ฝ๊ธฐ ์š”์ฒญ์˜ ์„ฑ๋Šฅ ์—ญ์‹œ ํ–ฅ์ƒ๋œ๋‹ค๋Š” ๊ฒƒ์„ ๋ณด์—ฌ์ค€๋‹ค.Fast storage and retrieval of information is one of the key challenges for modern computing systems. Magnetic hard disk drives as secondary storages over the past decades became a major performance bottleneck due to the increasing gap with microprocessor andmemory. In order tomitigate the gap, the existing storage stack evolved to be long and complex. Hierarchical design in modern storage systems has a fundamental drawback of an information gap: Narrow and simple interfaces over the storage stack hide much information into the inside of each layer. As a result, the information concealment is likely to hinder more efficent usage of disk drives.We believe collaborating in disk I/O subsystem based on informatin sharing would help improving disk I/O efficiency. In this dissertation, we study benefits of information sharing in disk I/O subsystems. We first focus on what information is useful to be shared. We study the semantic gap between hostOS and storage devices by examining the delicatemechanisms of modern disk drives. For this, we design and implement a software tool which can extract the low-level information from modern disk drives. To address the semantic gap observed in write-through caching disk, we propose Request interleaving, a block-level technique applying the low-level disk information into the scheduling decision. This technique reorders write requests in close proximity to avoid their long latency observed inwrite-through caching disk.We also study how to strengthen the existing disk I/O optimization techniques using the shared information. Using the block liveness information of filesystems, we extend the range of request merging technique into the non-successive requests. We call it Request bridging. We can coalesce separate write requests into larger ones, thus amortize the disk latency across more bytes of data. In our evaluation, the performance benefit for these parallel I/O applications is shown to be significant as we expected. Our evaluation also convinces us that the performance benefit in write requests can also increase the competitive reads in real-world workloads.1.INTRODUCTION 10_x000D_ 1.1 Information Sharing in Disk I/O Paths 11_x000D_ 1.2 Case study: Request Bridging and Interleaving 13_x000D_ 1.3 Evaluation 14_x000D_ 1.4 Contributions 16_x000D_ 1.5 Organization 17_x000D_ 2. BACKGROUND AND RELATED WORK 18_x000D_ 2.1 Background 18_x000D_ 2.1.1 Disk terminology 18_x000D_ 2.1.2 Disk buffer 19_x000D_ 2.1.3 Disk controller mechanism 20_x000D_ 2.2 Related Work 21_x000D_ 2.2.1 Low-level Disk Feature Extraction 21_x000D_ 2.2.2 Block-level I/O optimization in disk I/O layers 23_x000D_ 2.2.3 Cross-layer information sharing 24_x000D_ 2.2.4 Utilizing disk layout information and operational characteristics 24_x000D_ 3. CROSS-LAYER INFORMATION SHARING IN DISK I/O PATHS 26_x000D_ 3.1 Diskclose: Uncovering the Internal Layout of Storage Devices 26_x000D_ 3.1.1 Overview 26_x000D_ 3.1.2 Multidimensional disk layout model 28_x000D_ 3.1.3 Extraction methodology of layout model parameters 30_x000D_ 3.1.4 Inferring two-dimensional arrangement in a track group 37_x000D_ 3.1.5 Experimental result 42_x000D_ 3.1.6 Model verification and discussion 48_x000D_ 3.2 Analyzing Disk I/O Activity 49 _x000D_ 3.2.1 Disk I/O trace environments 52_x000D_ 3.2.2 Disk access pattern from multiple I/O stream workloads 54_x000D_ 3.2.3 Disk I/O activity analysis of write requests in close proximity 58 _x000D_ 3.3 Sharing Semantic Information Stored in Disk Blocks 60_x000D_ 3.3.1 Design 60 _x000D_ 3.3.2 Explicit notification interfaces 64_x000D_ 3.3.3 Guaranteeing system consistency 65_x000D_ 3.3.4 Implementation 67_x000D_ 4. CASE STUDY 70_x000D_ 4.1 Request Interleaving 70_x000D_ 4.1.1 Main idea 71_x000D_ 4.1.2 Determining a decision point for Request Interleaving 74_x000D_ 4.1.3 Guaranteeing data and system consistency 77_x000D_ 4.1.4 Implementation issues 77_x000D_ 4.2 Request Bridging 79_x000D_ 4.2.1 Overview 79_x000D_ 4.2.2 Block liveness checking 81_x000D_ 4.2.3 Page cache lookup in block I/O layer 81 _x000D_ 4.2.4 Implementation 84_x000D_ 5. PERFORMANCE EVALUATION 86_x000D_ 5.1 Write throughput 90_x000D_ 5.2 Request distribution 95_x000D_ 5.3 Maximum queue depth in disk drive 97_x000D_ 5.4 File system and scheduling algorithm effects 100_x000D_ 5.5 Write-back cache vs. Write-through cache 103 _x000D_ 5.6 Limitations and Discussion 106 _x000D_ 6. CONCLUSIONS 108_x000D_ 6.1 Future Work 108_x000D_ 6.1.1 Extraction Time in Diskclose 108_x000D_ 6.1.2 Utilizing semantic information of blocks stored in disk drive 108_x000D_ 6.1.3 Information sharing in RAID disks 109_x000D_ 6.2 Summary 110Docto

    IL-6๊ฐ€ ํŒŒ๊ณจ์„ธํฌํ˜•์„ฑ์— ๋ฏธ์น˜๋Š” ์˜ํ–ฅ ๋ฐ ์กฐ๊ณจ์„ธํฌ์—์„œ IL-6์˜ ๋ฐœํ˜„์กฐ์ ˆ์— ๊ด€ํ•œ ์—ฐ๊ตฌ

    No full text
    Thesis (doctoral)--์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› :์น˜์˜ํ•™๊ณผ ์น˜๊ณผ์•ฝ๋ฆฌํ•™์ „๊ณต,1996.Docto
    corecore