| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
Recently, researchers have actively studied on designing faster algorithms and their data structures for manycore processors, such as a multicore CPU and a GPU. Since data structures in many applications are shared by concurrent threads in these shared memory processors, the mutual exclusion for them becomes one of the serious bottlenecks.
To cope with this problem, this study presents on configuring concurrent data structures using hardware transactional memory which is recently available through case studies on LRU and B-tree. In addition, aiming at highly parallel processing on a GPU which can hardly use mutual exclusion, it is revealed that realistic text processing can greatly be accelerated by combining the dictionary primitive that we proposed and existing data parallel primitives.
|
