Online algorithms for scheduling transactions on python software transactional memory

Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce conflict-free transaction schedules. In this pape...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Popović Marko, Kordić Branislav, Popović Miroslav, Bašičević Ilija
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Faculty of Technical Sciences in Cacak 2019-01-01
Edice:	Serbian Journal of Electrical Engineering
Témata:	parallel programming transactional memory transaction scheduling algorithms time complexity
On-line přístup:	http://www.doiserbia.nb.rs/img/doi/1451-4869/2019/1451-48691901085P.pdf
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!