Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3848Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Chung, Shin Yee | - |
| dc.creator | Hsu, Wen Jing | - |
| dc.date | 2003-12-13T18:20:46Z | - |
| dc.date | 2003-12-13T18:20:46Z | - |
| dc.date | 2004-01 | - |
| dc.date.accessioned | 2013-10-09T02:32:49Z | - |
| dc.date.available | 2013-10-09T02:32:49Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/3848 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Modern processors rely on cache memories to reduce the latency of data accesses. Extensive cache misses would thus compromise the usefulness of the scheme. Cache-aware algorithms make use of the knowledge about the cache, such as the cache line size, L, and cache size, Z, to be cache efficient. However, careful tuning of these parameters for these algorithms is needed for different hardware platforms. Cache-oblivious (CO) algorithms were first introduced by Leiserson to work without the knowledge of the cache parameters mentioned earlier, but still achieve optimal work complexity and optimal cache complexity. Here we present CO algorithms for all-to-all operations (analogous to the cross-product operation). Its applications include Convolution, Polynomial Arithmetic, Multiple Sequence Alignment, N-Body Simulation, etc. Given two lists each with n elements, a naive implementation of all-to-all operation incurs O(n²/L) cache misses. Our CO version incurs only O(n²/L²√Z) cache misses. Preliminary experiments on Opteron 1.4GHz and MIPS 250MHz show that the CO implementation achieves two times faster. The profiling tool further confirms that the amount of cache misses is significantly lower. We also consider various situations where (a) the elements have non-uniform sizes, (b) an element cannot fit into the cache, (c) the lengths of the lists vary, and (d) an element is linked list. In addition, we study the extension to K-lists All-to-All Operation and its application. Finally, we will present the empirical results and compare with cache-aware algorithms. | - |
| dc.description | Singapore-MIT Alliance (SMA) | - |
| dc.format | 48735 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | Computer Science (CS); | - |
| dc.subject | cache-oblivious algorithms | - |
| dc.subject | all-to-all operations | - |
| dc.subject | cache misses | - |
| dc.title | Adaptive Cache-Oblivious All-to-All Operation | - |
| dc.type | Article | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.