Loading...
Search for: workload-characterization
0.003 seconds

    Operating system level data tiering using online workload characterization

    , Article Journal of Supercomputing ; Volume 71, Issue 4 , April , 2015 , Pages 1534-1562 ; 09208542 (ISSN) Salkhordeh, R ; Asadi, H ; Ebrahimi, S ; Sharif University of Technology
    Kluwer Academic Publishers  2015
    Abstract
    Over the past decade, storage has been the performance bottleneck in I/O-intensive programs such as online transaction processing applications. To alleviate this bottleneck with minimal cost penalty, cost-effective design of a high-performance disk subsystem is of decisive importance in enterprise applications. Data tiering is an efficient way to optimize cost, performance, and reliability in storage servers. With the promising advantages of solid-state drives (SSDs) over hard disk drives (HDDs) such as lower power consumption and higher performance, traditional data tiering techniques should be revisited to use SSDs in a more efficient way. Previously proposed tiering solutions have... 

    Why does data prefetching not work for modern workloads?

    , Article Computer Journal ; Volume 59, Issue 2 , 2016 , Pages 244-259 ; 00104620 (ISSN) Naderan Tahan, M ; Sarbazi Azad, H ; Sharif University of Technology
    Oxford University Press  2016
    Abstract
    Emerging cloud workloads in today's modern data centers have large memory footprints that make the processor's caches to be ineffective. Since L1 data cache is in the critical path, high data cache miss rates degrade the performance. To fix the issue in traditional workloads, data prefetchers predict the needed data to hide the memory latency and ultimately improve performance. In this paper, we focus on the L1 data cache to answer the question on why state-of-the-art prefetching methods are inefficient for modern workloads in terms of performance and energy consumption? This is because L1 cache is the most important player affecting the processor performance. Results show that, on the one...