Cahoon, B. und Mc Kinley, K.S. (2005) „Recurrence analysis for effective array prefetching in Java.“, Concurrency & Computation: Practice & Experience, 17(5/6), S. 589-616. doi:10.1002/cpe.851.
Chicago Manual of Style 17th edition (full note)Cahoon, Brendon, und Kathryn S. Mc Kinley. „Recurrence Analysis for Effective Array Prefetching in Java.“. Concurrency & Computation: Practice & Experience 17, Nr. 5/6 (1. April 2005): 589-616. https://doi.org/10.1002/cpe.851.
American Psychological Association 7th editionCahoon, B., & Mc Kinley, K. S. (2005). Recurrence analysis for effective array prefetching in Java. Concurrency & Computation: Practice & Experience, 17(5/6), 589-616. https://doi.org/10.1002/cpe.851
Modern Language Association 9th editionCahoon, B., und K. S. Mc Kinley. „Recurrence Analysis for Effective Array Prefetching in Java.“. Concurrency & Computation: Practice & Experience, Bd. 17, Nr. 5/6, April 2005, S. 589-16, https://doi.org/10.1002/cpe.851.
ISO-690 (author-date, Deutsch)CAHOON, Brendon und Kathryn S. MCKINLEY, 2005. Recurrence analysis for effective array prefetching in Java. Concurrency & Computation: Practice & Experience. 1 April 2005. Bd. 17, Nr. 5/6, S. 589-616. DOI 10.1002/cpe.851