|
|
@@ -2,13 +2,34 @@
|
|
|
%% http://bibdesk.sourceforge.net/
|
|
|
|
|
|
|
|
|
-%% Created for Jeremy Siek at 2020-09-28 12:47:15 -0400
|
|
|
+%% Created for Jeremy Siek at 2020-10-13 13:16:37 -0400
|
|
|
|
|
|
|
|
|
%% Saved with string encoding Unicode (UTF-8)
|
|
|
|
|
|
|
|
|
|
|
|
+@article{Collins:1960aa,
|
|
|
+ Abstract = {An important property of the Newell Shaw-Simon scheme for computer storage of lists is that data having multiple occurrences need not be stored at more than one place in the computer. That is, lists may be ``overlapped.'' Unfortunately, overlapping poses a problem for subsequent erasure. Given a list that is no longer needed, it is desired to erase just those parts that do not overlap other lists. In LISP, McCarthy employs an elegant but inefficient solution to the problem. The present paper describes a general method which enables efficient erasure. The method employs interspersed reference counts to describe the extent of the overlapping.},
|
|
|
+ Address = {New York, NY, USA},
|
|
|
+ Author = {Collins, George E.},
|
|
|
+ Date-Added = {2020-09-29 13:16:44 -0400},
|
|
|
+ Date-Modified = {2020-09-29 13:16:46 -0400},
|
|
|
+ Doi = {10.1145/367487.367501},
|
|
|
+ Issn = {0001-0782},
|
|
|
+ Issue_Date = {Dec. 1960},
|
|
|
+ Journal = {Commun. ACM},
|
|
|
+ Month = dec,
|
|
|
+ Number = {12},
|
|
|
+ Numpages = {3},
|
|
|
+ Pages = {655--657},
|
|
|
+ Publisher = {Association for Computing Machinery},
|
|
|
+ Title = {A Method for Overlapping and Erasure of Lists},
|
|
|
+ Url = {https://doi.org/10.1145/367487.367501},
|
|
|
+ Volume = {3},
|
|
|
+ Year = {1960},
|
|
|
+ Bdsk-Url-1 = {https://doi.org/10.1145/367487.367501}}
|
|
|
+
|
|
|
@inproceedings{Osterlund:2016aa,
|
|
|
Abstract = { On-the-fly Garbage Collectors (GCs) are the state-of-the-art concurrent GC algorithms today. Everything is done concurrently, but phases are separated by blocking handshakes. Hence, progress relies on the scheduler to let application threads (mutators) run into GC checkpoints to reply to the handshakes. For a non-blocking GC, these blocking handshakes need to be addressed. Therefore, we propose a new non-blocking handshake to replace previous blocking handshakes. It guarantees scheduling-independent operation level progress without blocking. It is scheduling independent but requires some other OS support. It allows bounded waiting for threads that are currently running on a processor, regardless of threads that are not running on a processor. We discuss this non-blocking handshake in two GC algorithms for stack scanning and copying objects. They pave way for a future completely non-blocking GC by solving hard open theory problems when OS support is permitted. The GC algorithms were integrated to the G1 GC of OpenJDK for Java. GC pause times were reduced to 12.5% compared to the original G1 on average in DaCapo. For a memory intense benchmark, latencies were reduced from 174 ms to 0.67 ms for the 99.99% percentile. The improved latency comes at a cost of 15% lower throughput. },
|
|
|
Address = {New York, NY, USA},
|
|
|
@@ -11872,7 +11893,7 @@ Gradual typing has explored how to incrementally move between static typing and
|
|
|
Url = {http://www.sciencedirect.com/science/article/pii/0890540191900557},
|
|
|
Volume = {93},
|
|
|
Year = {1991},
|
|
|
- Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAYaW5oZXJpdGFuY2UtY29lcmNpb24ucGRmTxEBXAAAAAABXAACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////GGluaGVyaXRhbmNlLWNvZXJjaW9uLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAQACAAAKIGN1AAAAAAAAAAAAAAAAAANiaWIAAAIAKi86VXNlcnM6anNpZWs6YmliOmluaGVyaXRhbmNlLWNvZXJjaW9uLnBkZgAOADIAGABpAG4AaABlAHIAaQB0AGEAbgBjAGUALQBjAG8AZQByAGMAaQBvAG4ALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAChVc2Vycy9qc2llay9iaWIvaW5oZXJpdGFuY2UtY29lcmNpb24ucGRmABMAAS8AABUAAgAM//8AAAAIAA0AGgAkAD8AAAAAAAACAQAAAAAAAAAFAAAAAAAAAAAAAAAAAAABnw==},
|
|
|
+ Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAYaW5oZXJpdGFuY2UtY29lcmNpb24ucGRmTxEBcAAAAAABcAACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////GGluaGVyaXRhbmNlLWNvZXJjaW9uLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAQACAAAKIGN1AAAAAAAAAAAAAAAAAANiaWIAAAIANC86VXNlcnM6anNpZWs6RG9jdW1lbnRzOmJpYjppbmhlcml0YW5jZS1jb2VyY2lvbi5wZGYADgAyABgAaQBuAGgAZQByAGkAdABhAG4AYwBlAC0AYwBvAGUAcgBjAGkAbwBuAC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgAyVXNlcnMvanNpZWsvRG9jdW1lbnRzL2JpYi9pbmhlcml0YW5jZS1jb2VyY2lvbi5wZGYAEwABLwAAFQACAAz//wAAAAgADQAaACQAPwAAAAAAAAIBAAAAAAAAAAUAAAAAAAAAAAAAAAAAAAGz},
|
|
|
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0890540191900557},
|
|
|
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0890-5401(91)90055-7}}
|
|
|
|
|
|
@@ -12067,9 +12088,9 @@ Gradual typing has explored how to incrementally move between static typing and
|
|
|
Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAWY29tcGlsZXJfZGVzaWduX3ZtLnBkZk8RAWgAAAAAAWgAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAAAAAABCRAAB/////xZjb21waWxlcl9kZXNpZ25fdm0ucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAEAAgAACiBjdQAAAAAAAAAAAAAAAAADYmliAAACADIvOlVzZXJzOmpzaWVrOkRvY3VtZW50czpiaWI6Y29tcGlsZXJfZGVzaWduX3ZtLnBkZgAOAC4AFgBjAG8AbQBwAGkAbABlAHIAXwBkAGUAcwBpAGcAbgBfAHYAbQAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAMFVzZXJzL2pzaWVrL0RvY3VtZW50cy9iaWIvY29tcGlsZXJfZGVzaWduX3ZtLnBkZgATAAEvAAAVAAIADP//AAAACAANABoAJAA9AAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAak=}}
|
|
|
|
|
|
@article{Appel:1989aa,
|
|
|
- Author = {Appel, AndrewW.},
|
|
|
+ Author = {Appel, Andrew W.},
|
|
|
Date-Added = {2015-07-03 01:40:40 +0000},
|
|
|
- Date-Modified = {2015-07-03 01:40:42 +0000},
|
|
|
+ Date-Modified = {2020-10-13 13:16:33 -0400},
|
|
|
Doi = {10.1007/BF01811537},
|
|
|
Issn = {0892-4635},
|
|
|
Journal = {LISP and Symbolic Computation},
|
|
|
@@ -20199,7 +20220,7 @@ semantics was validated.},
|
|
|
Url = {http://dx.doi.org/10.1007/BFb0017182},
|
|
|
Volume = {637},
|
|
|
Year = {1992},
|
|
|
- Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXGdjc3VydmV5LnBkZk8RASwAAAAAASwAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAAAAAABCRAAB/////wxnY3N1cnZleS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAEAAgAACiBjdQAAAAAAAAAAAAAAAAADYmliAAACAB4vOlVzZXJzOmpzaWVrOmJpYjpnY3N1cnZleS5wZGYADgAaAAwAZwBjAHMAdQByAHYAZQB5AC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgAcVXNlcnMvanNpZWsvYmliL2djc3VydmV5LnBkZgATAAEvAAAVAAIADP//AAAACAANABoAJAAxAAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAWE=},
|
|
|
+ Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXGdjc3VydmV5LnBkZk8RAUAAAAAAAUAAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAAAAAABCRAAB/////wxnY3N1cnZleS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAEAAgAACiBjdQAAAAAAAAAAAAAAAAADYmliAAACACgvOlVzZXJzOmpzaWVrOkRvY3VtZW50czpiaWI6Z2NzdXJ2ZXkucGRmAA4AGgAMAGcAYwBzAHUAcgB2AGUAeQAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAJlVzZXJzL2pzaWVrL0RvY3VtZW50cy9iaWIvZ2NzdXJ2ZXkucGRmABMAAS8AABUAAgAM//8AAAAIAA0AGgAkADEAAAAAAAACAQAAAAAAAAAFAAAAAAAAAAAAAAAAAAABdQ==},
|
|
|
Bdsk-Url-1 = {http://dx.doi.org/10.1007/BFb0017182}}
|
|
|
|
|
|
@book{Mitchell:2003kx,
|
Jeremy Siek