TY - GEN
T1 - The challenge of eliminating storage bottlenecks in distributed systems
AU - Ueda, Takanori
AU - Hirate, Yu
AU - Yamana, Hayato
PY - 2009
Y1 - 2009
N2 - One of the most difficult problems in distributed systems is load-balancing. Even if we take care of load-balancing, heavily-loaded nodes often occur while there are still lightly-loaded nodes that have idle memory and idle CPU power. Our idea is to exploit this idle memory and idle CPU power to improve the storage performance of heavily-loaded nodes. Idle memory can be used for caching file data and idle CPU power can be used for extracting file access patterns from file access logs. File access patterns are valuable sources for optimizing a cache strategy. Our project goal is to improve the overall performance of distributed systems by improving storage access performance. This paper gives an overview of this project idea and reports the current status of the project. In addition, we show benchmark results from our prototype cache extension system, which is implemented in Linux Kernel 2.6. The DBT-3 (TPC-H) benchmark results show that our system can increase computer speed by a factor of 6.68.
AB - One of the most difficult problems in distributed systems is load-balancing. Even if we take care of load-balancing, heavily-loaded nodes often occur while there are still lightly-loaded nodes that have idle memory and idle CPU power. Our idea is to exploit this idle memory and idle CPU power to improve the storage performance of heavily-loaded nodes. Idle memory can be used for caching file data and idle CPU power can be used for extracting file access patterns from file access logs. File access patterns are valuable sources for optimizing a cache strategy. Our project goal is to improve the overall performance of distributed systems by improving storage access performance. This paper gives an overview of this project idea and reports the current status of the project. In addition, we show benchmark results from our prototype cache extension system, which is implemented in Linux Kernel 2.6. The DBT-3 (TPC-H) benchmark results show that our system can increase computer speed by a factor of 6.68.
KW - Access pattern
KW - Access pattern mining
KW - Buffer caching
KW - Distributed systems
KW - Replacement algorithm
UR - http://www.scopus.com/inward/record.url?scp=84880422401&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880422401&partnerID=8YFLogxK
U2 - 10.1109/STFSSD.2009.46
DO - 10.1109/STFSSD.2009.46
M3 - Conference contribution
AN - SCOPUS:84880422401
SN - 9780769535722
T3 - Proceedings - 1st International Workshop on Software Technologies for Future Dependable Distributed Systems, STFSSD 2009
SP - 49
EP - 53
BT - Proceedings - 1st International Workshop on Software Technologies for Future Dependable Distributed Systems, STFSSD 2009
T2 - 1st International Workshop on Software Technologies for Future Dependable Distributed Systems, STFSSD 2009
Y2 - 17 March 2009 through 18 March 2009
ER -