hyunsukimsokcho/minics

Critical section minimisation in concurrent programming

miniCS

The goal of this project is to minimise critical section in concurrent programming by applying heuristics. (e.g. GA)

It is usually known that there is no gold standard for setting critical sections. (i.e. when to acquire lock, then when to release the lock) We may need to tackle some intractability such as combinatorically explosive cases due to nondeterministic thread interleaving.

Progress

[31 Oct] Initial setup for group report release.

[02 Nov] Author registration complete.

[05 Nov] Started writing abstract.

[28 Nov] Wrote two easy test cases. Used Clang AST to find references to global variables.

[29 Nov] Used Clang AST to find scopes.

[1 Dec] Generated all candidates to place a lock.

[9 Dec] Implemented threadSanitizer error message parser.

[11 Dec] Started writing GA.

[12 Dec] Added three test cases.

[13 Dec] Wrote abstract and population generation.

[14 Dec] Added machine instruction counter.

[15 Dec] Completed evaluation.

minics's Issues

Somethings about bugs

1. multithread code 함수 0index 와 1index 혼용해서 버그생김
2. crossover 함수 list 복사해서 대입하면 될 듯?

Population candidate generator 버그

return문 뒤에 lock을 해제하는 경우가 있습니다. 다음 버전에서 수정할 예정입니다.