Loading...
Please wait, while we are loading the content...
Similar Documents
Brief Announcement: Reduced I/O Latency with Futures
| Content Provider | Semantic Scholar |
|---|---|
| Author | Singer, Kyle Agrawal, Kunal Lee, I-Ting Angelina |
| Copyright Year | 2019 |
| Abstract | Task parallelism research has traditionally focused on optimizing computation-intensive applications. Due to the proliferation of commodity parallel processors, there has been recent interest in supporting interactive applications. Such interactive applications frequently rely on I/O operations that may incur significant latency. In order to increase performance, when a particular thread of control is blocked on an I/O operation, ideally we would like to hide this latency by using the processing resources to do other ready work instead of blocking or spin waiting on this I/O. There has been limited prior work on hiding this latency. As far as we are aware, only one prior work exists that provides a theoretical bound for interactive applications that use I/Os. In this work, we propose a method for hiding the latency of I/O operations by using the futures abstraction. We provide better execution time guarantees using this method than prior work. We also implemented the algorithm in a practically efficient prototype library that runs on top of the Cilk-F runtime, a runtime system that supports futures within the context of the Cilk Plus language, and performed experiments that demonstrate the efficiency of our implementation. |
| File Format | PDF HTM / HTML |
| DOI | 10.1145/3323165.3323175 |
| Alternate Webpage(s) | https://www.cse.wustl.edu/~angelee/home_page/papers/futureIO-BA.pdf |
| Alternate Webpage(s) | https://doi.org/10.1145/3323165.3323175 |
| Journal | SPAA '19 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
