SCHEDULE: NOV 16-22, 2013
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Transactional Memory as Synchronization Solution for Parallel Graph Exploration
SESSION: Doctoral Showcase - Early Research Showcase
EVENT TYPE: Doctoral Showcase - Early Research Showcases
TIME: 3:30PM - 5:00PM
SESSION CHAIR: Wojtek James Goscinski
Presenter(s):Mohammad Qayum
ROOM:601/603
ABSTRACT:
Synchronization of parallel applications like large graphs is very complex. Two major synchronization policies are used in most the architectures are- coarse grain which sequentializes program execution and fine grain which is notoriously complex. Transactional memory (TM) attempts to mitigate complexity in programming and also, provides concurrency. Parallel graph algorithms are mostly based on irregular data structures. In a large graph it is very unlikely that multiple threads will try to access the same vertex at the same time. TM benefits when there is low number of conflicts among the transactions. And, if enough number of transactions exists, they can run concurrently too. Some research results with graph benchmarks like SSCA-2 using Software based TM shows some improvements. Currently, we are working with graph benchmarks to use hardware TM support implemented in Intel Haswell architecture and believe that HTM will perform better than STM used in previous research.
Chair/Presenter Details:
Wojtek James Goscinski (Chair) - Monash University
Mohammad Qayum - New Mexico State University
Click here to download .ics calendar file
