Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Shavit, Nir N."'
Publikováno v:
arXiv
Traditional image and video compression algorithms rely on hand-crafted encoder/decoder pairs (codecs) that lack adaptability and are agnostic to the data being compressed. We describe the concept of generative compression, the compression of data us
Publikováno v:
MIT web domain
The problem of efficient concurrent memory reclamation in unmanaged languages such as C or C++ is one of the major challenges facing the parallelization of billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient; thus, progr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::b64bd786222ea29b992f8b47028ed9e8
https://hdl.handle.net/1721.1/123336
https://hdl.handle.net/1721.1/123336
Publikováno v:
MIT web domain
All consensus hierarchies in the literature assume that we have, in addition to copies of a given object, an unbounded number of registers. But why do we really need these registers? This paper considers what would happen if one attempts to solve con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::df8b6aa268aeb96cd486f92610e3a81f
https://orcid.org/0000-0003-4213-9898
https://orcid.org/0000-0003-4213-9898
Publikováno v:
MIT web domain
The Java[superscript TM] developers kit requires a size() operation for all objects, tracking the number of elements in the object. Unfortunately, the best known solution, available in the Java concurrency package, has a blocking concurrent implement
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::63ff335a540ee7c582d102151bd6e6fa
http://hdl.handle.net/1721.1/101051
http://hdl.handle.net/1721.1/101051
Autor:
Herlihy, Maurice, Shavit, Nir N.
Publikováno v:
Other Repository
15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings
We identify a simple relationship that unifies seemingly unrelated progress conditions ranging from the deadlock-free and starvation-free properties
We identify a simple relationship that unifies seemingly unrelated progress conditions ranging from the deadlock-free and starvation-free properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::abde6fca3987c7683744d78fa0e93b52
http://hdl.handle.net/1721.1/73900
http://hdl.handle.net/1721.1/73900
Publikováno v:
Other University Web Domain
15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings
It is well known that guaranteeing program consistency when accessing shared data comes at the price of degraded performance and scalability. This pa
It is well known that guaranteeing program consistency when accessing shared data comes at the price of degraded performance and scalability. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::d957b1c561030828c99dde921944b3c7
http://hdl.handle.net/1721.1/73899
http://hdl.handle.net/1721.1/73899
Autor:
Agesen, Ole, Detlefs, David L., Flood, Christine H., Garthwaite, Alexander T., Martin, Paul A., Shavit, Nir N., Steele, Guy L.
Publikováno v:
Proceedings of the Twelfth Annual ACM Symposium: Parallel Algorithms & Architectures; 7/ 9/2000, p137-146, 10p
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.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Agesen, Ole, Detlefs, David L., Flood, Christine H., Garthwaite, Alexander T., Martin, Paul A., Moir, Mark, Shavit, Nir N., Steele Jr., Guy L.
Publikováno v:
Theory of Computing Systems; 2002, Vol. 35 Issue 3, p349, 38p
Publikováno v:
SPAA
MIT Web Domain
MIT Web Domain
The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, the