Lace: non-blocking split deque for work-stealing

Work-stealing is an efficient method to implement load balancing in fine-grained task parallelism. Typically, concurrent deques are used for this purpose. A disadvantage of many concurrent deques is that they require expensive memory fences for local deque operations.\ud \ud In this paper, we propose a new non-blocking work-stealing deque based on the split task queue. Our design uses a dynamic split point between the shared and the private portions of the deque, and only requires memory fences when shrinking the shared portion.\ud \ud We present Lace, an implementation of work-stealing based on this deque, with an interface similar to the work-stealing library Wool, and an evaluation of Lace based on several common benchmarks. We also implement a recent approach using private deques in Lace. We show that the split deque and the private deque in Lace have similar low overhead and high scalability as Wool

PRIKAZ BALASOVOG ALGORITMA ZA 0-1 PROGRAMIRANJE

U uvodnom dijelu rada govori se o cjelobrojnom i nula-jedan programiranju. Daljnji tekst sadrži prikaz Balasovog algoritma za nula-jedan programiranje (poznatog još pod nazivom metoda djelomičnog nabrajanja). Rješavanje zadataka pomoću navedenog algoritma prikazano je detaljno na jednom primjeru, a za drugi su pregledno navedeni algoritamski koraci koji se primjenjuju tokom rješavanja zadatka