{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81611"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81611","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Improving Memory Performance Using Intelligent Memory","abstract":"Alternatively, the memory can directly execute memory-intensive code sections. We propose a compiler and run-time algorithm to break out the code into sections with uniform memory and compute behavior. These sections are statically or dynamically mapped on the memory or the main processor based on their affinity. In addition, processor and memory overlap their execution as much as possible. We show that the resulting speedups are close and often higher than ideal speedups on a more expensive machine with two identical main processors.","abstract_html":"Alternatively, the memory can directly execute memory-intensive code sections. We propose a compiler and run-time algorithm to break out the code into sections with uniform memory and compute behavior. These sections are statically or dynamically mapped on the memory or the main processor based on their affinity. In addition, processor and memory overlap their execution as much as possible. We show that the resulting speedups are close and often higher than ideal speedups on a more expensive machine with two identical main processors.","abstract_has_math":false,"creators":["Solihin, Yan"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Torrellas, Josep"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:31Z","date_published":"2015-09-25T20:19:31Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3070443"],"render_values":[{"text":"(MiAaPQ)AAI3070443","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81611","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Torrellas, Josep"]},{"key":"dc:creator","label":"Author","values":["Solihin, Yan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:31Z","10000-01-01","2002"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81611","(MiAaPQ)AAI3070443"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Alternatively, the memory can directly execute memory-intensive code sections. We propose a compiler and run-time algorithm to break out the code into sections with uniform memory and compute behavior. These sections are statically or dynamically mapped on the memory or the main processor based on their affinity. In addition, processor and memory overlap their execution as much as possible. We show that the resulting speedups are close and often higher than ideal speedups on a more expensive machine with two identical main processors.","Made available in DSpace on 2015-09-25T20:19:31Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3070443.pdf: 5213852 bytes, checksum: 7d96ed4da4fa2116f89bc9aad3650f15 (MD5) Previous issue date: 2002","Embargo set by: Seth Robbins for item 82892 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","102 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002."]},{"key":"dc:title","label":"Title","values":["Improving Memory Performance Using Intelligent Memory"]}]}],"canonical_facts":{"dc:contributor":["Torrellas, Josep"],"dc:creator":["Solihin, Yan"],"dc:date":["2015-09-25T20:19:31Z","10000-01-01","2002"],"dc:description":["Alternatively, the memory can directly execute memory-intensive code sections. We propose a compiler and run-time algorithm to break out the code into sections with uniform memory and compute behavior. These sections are statically or dynamically mapped on the memory or the main processor based on their affinity. In addition, processor and memory overlap their execution as much as possible. We show that the resulting speedups are close and often higher than ideal speedups on a more expensive machine with two identical main processors.","Made available in DSpace on 2015-09-25T20:19:31Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3070443.pdf: 5213852 bytes, checksum: 7d96ed4da4fa2116f89bc9aad3650f15 (MD5) Previous issue date: 2002","Embargo set by: Seth Robbins for item 82892 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","102 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002."],"dc:identifier":["http://hdl.handle.net/2142/81611","(MiAaPQ)AAI3070443"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Improving Memory Performance Using Intelligent Memory"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}