relwork: continuation of compilers section

thesis/references.bib

@@ -895,6 +895,55 @@ Publisher: Multidisciplinary Digital Publishing Institute},
 	author = {Lattner, C. and Adve, V.},
 	urldate = {2025-03-18},
 	date = {2004-03},
-	keywords = {Algorithm design and analysis, Application software, Arithmetic, High level languages, Information analysis, Performance analysis, Program processors, Runtime, Software safety, Virtual machining},
+	keywords = {Runtime, Application software, Algorithm design and analysis, Arithmetic, High level languages, Information analysis, Performance analysis, Program processors, Software safety, Virtual machining},
 	file = {Full Text PDF:C\:\\Users\\danwi\\Zotero\\storage\\P2U5LRF2\\Lattner and Adve - 2004 - LLVM a compilation framework for lifelong program analysis & transformation.pdf:application/pdf;IEEE Xplore Abstract Record:C\:\\Users\\danwi\\Zotero\\storage\\U58QV47G\\1281665.html:text/html},
 }
+
+@article{khairy_survey_2019,
+	title = {A survey of architectural approaches for improving {GPGPU} performance, programmability and heterogeneity},
+	volume = {127},
+	issn = {0743-7315},
+	url = {https://www.sciencedirect.com/science/article/pii/S0743731518308669},
+	doi = {10.1016/j.jpdc.2018.11.012},
+	abstract = {With the skyrocketing advances of process technology, the increased need to process huge amount of data, and the pivotal need for power efficiency, the usage of Graphics Processing Units ({GPUs}) for General Purpose Computing becomes a trend and natural. {GPUs} have high computational power and excellent performance per watt, for data parallel applications, relative to traditional multicore processors. {GPUs} appear as discrete or embedded with Central Processing Units ({CPUs}), leading to a scheme of heterogeneous computing. Heterogeneous computing brings as many challenges as it brings opportunities. To get the most of such systems, we need to guarantee high {GPU} utilization, deal with irregular control flow of some workloads, and struggle with far-friendly-programming models. The aim of this paper is to provide a survey about {GPUs} from two perspectives: (1) architectural advances to improve performance and programmability and (2) advances to enhance {CPU}–{GPU} integration in heterogeneous systems. This will help researchers see the opportunities and challenges of using {GPUs} for general purpose computing, especially in the era of big data and the continuous need of high-performance computing.},
+	pages = {65--88},
+	journaltitle = {Journal of Parallel and Distributed Computing},
+	shortjournal = {Journal of Parallel and Distributed Computing},
+	author = {Khairy, Mahmoud and Wassal, Amr G. and Zahran, Mohamed},
+	urldate = {2025-03-20},
+	date = {2019-05-01},
+	keywords = {Control divergence, {GPGPU}, Heterogeneous architecture, Memory systems},
+	file = {PDF:C\:\\Users\\danwi\\Zotero\\storage\\FQJC5EUT\\Khairy et al. - 2019 - A survey of architectural approaches for improving GPGPU performance, programmability and heterogene.pdf:application/pdf},
+}
+
+@online{microsoft_overview_2023,
+	title = {Overview of .{NET} Framework - .{NET} Framework {\textbar} Microsoft Learn},
+	url = {https://learn.microsoft.com/en-us/dotnet/framework/get-started/overview},
+	author = {{Microsoft}},
+	urldate = {2025-03-20},
+	date = {2023-03},
+}
+
+@article{chomsky_certain_1959,
+	title = {On certain formal properties of grammars},
+	volume = {2},
+	issn = {0019-9958},
+	url = {https://www.sciencedirect.com/science/article/pii/S0019995859903626},
+	doi = {10.1016/S0019-9958(59)90362-6},
+	abstract = {A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequence of restrictions that limit grammars first to Turing machines, then to two types of system from which a phrase structure description of the generated language can be drawn, and finally to finite state Markov sources (finite automata). These restrictions are shown to be increasingly heavy in the sense that the languages that can be generated by grammars meeting a given restriction constitute a proper subset of those that can be generated by grammars meeting the preceding restriction. Various formulations of phrase structure description are considered, and the source of their excess generative power over finite state sources is investigated in greater detail.},
+	pages = {137--167},
+	number = {2},
+	journaltitle = {Information and Control},
+	shortjournal = {Information and Control},
+	author = {Chomsky, Noam},
+	urldate = {2025-03-20},
+	date = {1959-06-01},
+	file = {PDF:C\:\\Users\\danwi\\Zotero\\storage\\7KYIINJ3\\Chomsky - 1959 - On certain formal properties of grammars.pdf:application/pdf},
+}
+
+@report{johnson_yacc_1975,
+	title = {Yacc: Yet another compiler-compiler},
+	institution = {Bell Laboratories Murray Hill, {NJ}},
+	author = {Johnson, Stephen C},
+	date = {1975},
+}