Výsledky vyhledávání - "Hesselink, W.H."

Akademický článek

A general lock-free algorithm using compare-and-swap

Autor: Gao, H., Hesselink, W.H.

Publikováno v: In Information and Computation 2007 205(2):225-241

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Lock-Free Parallel Garbage Collection

Autor: Gao, H., Groote, J.F., Hesselink, W.H., Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J.J.

Publikováno v: Parallel and Distributed Processing and Applications ISBN: 9783540297697
ISPA
Parallel and distributed processing and applications (Third International Symposium, ISPA'05, Nanjing, China, November 2-5, 2005. Proceedings), 263-274
STARTPAGE=263;ENDPAGE=274;TITLE=Parallel and distributed processing and applications (Third International Symposium, ISPA'05, Nanjing, China, November 2-5, 2005. Proceedings)
University of Groningen
PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 263-274
STARTPAGE=263;ENDPAGE=274;TITLE=PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS

This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives compare-and-swap (CAS) and load-linked/store-conditional (LL/SC) offered by machine architectures. Mutator

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e315dffcbc9643a1b5ade87605bb690
https://doi.org/10.1007/11576235_31

Zobrazit plný text záznamu

A formal reduction for lock-free parallel algorithms

Autor: Gao, H., Hesselink, W.H., Alur, R, Peled, DA

Publikováno v: EPRINTS-BOOK-TITLE, 44-56
STARTPAGE=44;ENDPAGE=56;TITLE=EPRINTS-BOOK-TITLE

On shared memory multiprocessors, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Lock-free algorithms can do without locking mechanisms, and are therefore desirable. Lock-free algorithms are har

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::91980f749688fd9fa604196def9a792e
https://research.rug.nl/en/publications/825edb3f-f7af-430d-ad3c-f567e37f1e97

Zobrazit plný text záznamu

A general algorithm for computing distance transforms in linear time

Autor: Meijster, A., Roerdink, J.B.T.M., Hesselink, W.H., Goutsias, J, Vincent, L, Bloomberg, DS

Publikováno v: MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING, 331-340
STARTPAGE=331;ENDPAGE=340;TITLE=MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING

A new general algorithm fur computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the se

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::2357925d742f985e9d5992ded1d40755
https://research.rug.nl/en/publications/15dd2ec9-d221-45da-b2b0-1164978717dc

Zobrazit plný text záznamu

The design of a linearization of a concurrent data object

Autor: Hesselink, W.H., Gries, D, de Roever, W -P

Publikováno v: Programming Concepts and Methods, 205-224
STARTPAGE=205;ENDPAGE=224;TITLE=Programming Concepts and Methods

A design is presented for fault tolerant linearization of a concurrent data object in shared memory. Server processes may stop and restart functioning without notification, but always at least one member of each family of server processes makes progr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::2025e75399619e3140960971b7156dca
https://research.rug.nl/en/publications/e9a94942-a11c-4796-b7d1-bc16884e6e89

Zobrazit plný text záznamu