Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ulan Degenbaev"'
Publikováno v:
Communications of the ACM. 62:36-41
A collaborative approach to reclaiming memory in heterogeneous software systems.
Publikováno v:
Queue. 17:98-115
Cross-component tracing is a way to solve the problem of reference cycles across component boundaries. This problem appears as soon as components can form arbitrary object graphs with nontrivial ownership across API boundaries. An incremental version
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-24
Embedding a modern language runtime as a component in a larger software system is popular these days. Communication between these systems often requires keeping references to each others' objects. In this paper we present and discuss the problem of c
Publikováno v:
Communications of the ACM. 59:34-39
Efficient garbage collection is increasingly important in today's managed language runtime systems that demand low latency, low memory consumption, and high throughput. Garbage collection may pause the application for many milliseconds to identify li
Publikováno v:
Queue. 14:35-52
Google’s Chrome web browser strives to deliver a smooth user experience. An animation will update the screen at 60 FPS (frames per second), giving Chrome around 16.6 milliseconds to perform the update. Within these 16.6 ms, all input events have to
Publikováno v:
PLDI
Efficient garbage collection is increasingly important in today's managed language runtime systems that demand low latency, low memory consumption, and high throughput. Garbage collection may pause the application for many milliseconds to identify li
Autor:
Ernie Cohen, Vladimir Boyarinov, Eyad Alkassar, Steven Obua, Wolfram Schulte, Markus Dahlweid, Dirk Leinenbach, Ulan Degenbaev, Mark Hillebrand, Norbert Schirmer, Sabine Schmaltz, Michal Moskal, Sergey Tverdyshev, Hristo Pentchev, Wolfgang J. Paul, Andrey Shadrin, Bruno Langenstein, Elena Petrova, Alexandra Tsyban, Stephan Tobies, Thomas Santen
Publikováno v:
Perspectives of Systems Informatics ISBN: 9783642114854
Ershov Memorial Conference
Ershov Memorial Conference
The quest for modular concurrency reasoning has led to recent proposals that extend program assertions to include not just knowledge about the state, but rights to access the state. We argue that these rights are really just sugar for knowledge that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39e3fdc26aef4854e79f886b47affe8d
https://doi.org/10.1007/978-3-642-11486-1_4
https://doi.org/10.1007/978-3-642-11486-1_4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642034558
Efficient Algorithms
Efficient Algorithms
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buffers and store buffer forwarding, cache coherence protocols, out of order access to memory, segmentation and paging, shared memory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef99c224b28dc0798b6cabea4d25849
https://doi.org/10.1007/978-3-642-03456-5_5
https://doi.org/10.1007/978-3-642-03456-5_5