TY - GEN
T1 - Conflict avoidance scheduling using grouping list for transactional memory
AU - Choi, Dongmin
AU - Kim, Seung Hun
AU - Ro, Won W.
PY - 2012
Y1 - 2012
N2 - Conventional Transactional Memory (TM) systems may experience performance degradation in applications with high contention, given the fact that execution of transaction will frequently restart due to conflicts. The restarting of transaction essentially requires rollback that is a wasteful operation. To address this point, we developed a system to reduce the overhead caused by high contention. In this paper, we present a method called Conflict Avoidance Scheduling (CAS), which prevents the conflicts in high contention by use of conflict characteristic. In CAS, threads that execute transactions which have high probability of conflicts are grouped together. Based on the group information, concurrent execution of threads in the same group is restricted. Therefore, threads that may cause conflict are serially executed. We evaluate the performance of the proposed design by comparing it with Log TM-SE. The simulation results show that our system improves the performance by 23% on an average in applications with high contention, as compared with the conventional Log TM-SE.
AB - Conventional Transactional Memory (TM) systems may experience performance degradation in applications with high contention, given the fact that execution of transaction will frequently restart due to conflicts. The restarting of transaction essentially requires rollback that is a wasteful operation. To address this point, we developed a system to reduce the overhead caused by high contention. In this paper, we present a method called Conflict Avoidance Scheduling (CAS), which prevents the conflicts in high contention by use of conflict characteristic. In CAS, threads that execute transactions which have high probability of conflicts are grouped together. Based on the group information, concurrent execution of threads in the same group is restricted. Therefore, threads that may cause conflict are serially executed. We evaluate the performance of the proposed design by comparing it with Log TM-SE. The simulation results show that our system improves the performance by 23% on an average in applications with high contention, as compared with the conventional Log TM-SE.
KW - Conflict Avoidance Scheduling
KW - Contention Management
KW - High Contention
KW - Transactional Memory
UR - http://www.scopus.com/inward/record.url?scp=84867416941&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867416941&partnerID=8YFLogxK
U2 - 10.1109/IPDPSW.2012.66
DO - 10.1109/IPDPSW.2012.66
M3 - Conference contribution
AN - SCOPUS:84867416941
SN - 9780769546766
T3 - Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
SP - 547
EP - 556
BT - Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
T2 - 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
Y2 - 21 May 2012 through 25 May 2012
ER -