Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(data locality). Showing records 1 – 30 of 51 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


NSYSU

1. Fan, Yi-Da. Software Design of Estimation Method of Program Data Locality.

Degree: Master, Electrical Engineering, 2008, NSYSU

Data accesses consume considerable execution time during program execution. If we can improve the data access time at compile time, overall program execution time can… (more)

Subjects/Keywords: data locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fan, Y. (2008). Software Design of Estimation Method of Program Data Locality. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911108-195211

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fan, Yi-Da. “Software Design of Estimation Method of Program Data Locality.” 2008. Thesis, NSYSU. Accessed April 13, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911108-195211.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fan, Yi-Da. “Software Design of Estimation Method of Program Data Locality.” 2008. Web. 13 Apr 2021.

Vancouver:

Fan Y. Software Design of Estimation Method of Program Data Locality. [Internet] [Thesis]. NSYSU; 2008. [cited 2021 Apr 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911108-195211.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fan Y. Software Design of Estimation Method of Program Data Locality. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911108-195211

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rice University

2. Liu, Xu. Performance Analysis of Program Executions on Modern Parallel Architectures.

Degree: PhD, Engineering, 2014, Rice University

 Parallel architectures have become common in supercomputers, data centers, and mobile chips. Usually, parallel architectures have complex features: many hardware threads, deep memory hierarchies, and… (more)

Subjects/Keywords: OpenMP; data locality; performance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, X. (2014). Performance Analysis of Program Executions on Modern Parallel Architectures. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87790

Chicago Manual of Style (16th Edition):

Liu, Xu. “Performance Analysis of Program Executions on Modern Parallel Architectures.” 2014. Doctoral Dissertation, Rice University. Accessed April 13, 2021. http://hdl.handle.net/1911/87790.

MLA Handbook (7th Edition):

Liu, Xu. “Performance Analysis of Program Executions on Modern Parallel Architectures.” 2014. Web. 13 Apr 2021.

Vancouver:

Liu X. Performance Analysis of Program Executions on Modern Parallel Architectures. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1911/87790.

Council of Science Editors:

Liu X. Performance Analysis of Program Executions on Modern Parallel Architectures. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87790


Penn State University

3. Ding, Wei. A Fresh Look At Data Locality On Emerging Multicores And Manycores.

Degree: 2014, Penn State University

 The emergence of multicore platforms offers several opportunities for boosting ap- plication performance. These opportunities, which include parallelism and data locality benefits, require strong support… (more)

Subjects/Keywords: Data Locality; Multicore; Manycore; Compiler; Loop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ding, W. (2014). A Fresh Look At Data Locality On Emerging Multicores And Manycores. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/22506

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ding, Wei. “A Fresh Look At Data Locality On Emerging Multicores And Manycores.” 2014. Thesis, Penn State University. Accessed April 13, 2021. https://submit-etda.libraries.psu.edu/catalog/22506.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ding, Wei. “A Fresh Look At Data Locality On Emerging Multicores And Manycores.” 2014. Web. 13 Apr 2021.

Vancouver:

Ding W. A Fresh Look At Data Locality On Emerging Multicores And Manycores. [Internet] [Thesis]. Penn State University; 2014. [cited 2021 Apr 13]. Available from: https://submit-etda.libraries.psu.edu/catalog/22506.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ding W. A Fresh Look At Data Locality On Emerging Multicores And Manycores. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/22506

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

4. Tang, Xulong. Irregularity-aware Computation and Data Management in Manycore Systems.

Degree: 2019, Penn State University

 During the past decade, the slow down of scaling in transistor technology has brought the chip design to the ``post-Moore'' era, where integrating more transistors… (more)

Subjects/Keywords: GPGPUs; Manycore architecture; Data locality; Irregular applications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tang, X. (2019). Irregularity-aware Computation and Data Management in Manycore Systems. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16942xzt102

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tang, Xulong. “Irregularity-aware Computation and Data Management in Manycore Systems.” 2019. Thesis, Penn State University. Accessed April 13, 2021. https://submit-etda.libraries.psu.edu/catalog/16942xzt102.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tang, Xulong. “Irregularity-aware Computation and Data Management in Manycore Systems.” 2019. Web. 13 Apr 2021.

Vancouver:

Tang X. Irregularity-aware Computation and Data Management in Manycore Systems. [Internet] [Thesis]. Penn State University; 2019. [cited 2021 Apr 13]. Available from: https://submit-etda.libraries.psu.edu/catalog/16942xzt102.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tang X. Irregularity-aware Computation and Data Management in Manycore Systems. [Thesis]. Penn State University; 2019. Available from: https://submit-etda.libraries.psu.edu/catalog/16942xzt102

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Rochester

5. Lavaee Mashhadi, Rahman. Profile-guided memory layout: theory and practice.

Degree: PhD, 2018, University of Rochester

 Modern software is growing in size and complexity, far faster than is hardware in performance. In particular, it executes and accesses an increasingly large amount… (more)

Subjects/Keywords: Locality optimization; Spatial locality; Code layout; Data packing; Cache; Miss minimization; Hit maximization; Proximity graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lavaee Mashhadi, R. (2018). Profile-guided memory layout: theory and practice. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/33857

Chicago Manual of Style (16th Edition):

Lavaee Mashhadi, Rahman. “Profile-guided memory layout: theory and practice.” 2018. Doctoral Dissertation, University of Rochester. Accessed April 13, 2021. http://hdl.handle.net/1802/33857.

MLA Handbook (7th Edition):

Lavaee Mashhadi, Rahman. “Profile-guided memory layout: theory and practice.” 2018. Web. 13 Apr 2021.

Vancouver:

Lavaee Mashhadi R. Profile-guided memory layout: theory and practice. [Internet] [Doctoral dissertation]. University of Rochester; 2018. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1802/33857.

Council of Science Editors:

Lavaee Mashhadi R. Profile-guided memory layout: theory and practice. [Doctoral Dissertation]. University of Rochester; 2018. Available from: http://hdl.handle.net/1802/33857


University of Illinois – Urbana-Champaign

6. Yekkehkhany, Ali. Near-data scheduling for data centers with multiple levels of data locality.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

Data locality is a fundamental issue for data-parallel applications. Considering MapReduce in Hadoop, the map task scheduling part requires an efficient algorithm which takes data(more)

Subjects/Keywords: Queueing theory; Load balancing; Scheduling; Routing; Near-data scheduling; Data locality; Data center

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yekkehkhany, A. (2017). Near-data scheduling for data centers with multiple levels of data locality. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yekkehkhany, Ali. “Near-data scheduling for data centers with multiple levels of data locality.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 13, 2021. http://hdl.handle.net/2142/97349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yekkehkhany, Ali. “Near-data scheduling for data centers with multiple levels of data locality.” 2017. Web. 13 Apr 2021.

Vancouver:

Yekkehkhany A. Near-data scheduling for data centers with multiple levels of data locality. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2142/97349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yekkehkhany A. Near-data scheduling for data centers with multiple levels of data locality. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brunel University

7. Zhao, Yu. High performance Monte Carlo computation for finance risk data analysis.

Degree: PhD, 2013, Brunel University

 Finance risk management has been playing an increasingly important role in the finance sector, to analyse finance data and to prevent any potential crisis. It… (more)

Subjects/Keywords: 650.01; Value at risk; Parallelizing; Mapreduce model; Hadoop; Data locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhao, Y. (2013). High performance Monte Carlo computation for finance risk data analysis. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/8206 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.600478

Chicago Manual of Style (16th Edition):

Zhao, Yu. “High performance Monte Carlo computation for finance risk data analysis.” 2013. Doctoral Dissertation, Brunel University. Accessed April 13, 2021. http://bura.brunel.ac.uk/handle/2438/8206 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.600478.

MLA Handbook (7th Edition):

Zhao, Yu. “High performance Monte Carlo computation for finance risk data analysis.” 2013. Web. 13 Apr 2021.

Vancouver:

Zhao Y. High performance Monte Carlo computation for finance risk data analysis. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2021 Apr 13]. Available from: http://bura.brunel.ac.uk/handle/2438/8206 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.600478.

Council of Science Editors:

Zhao Y. High performance Monte Carlo computation for finance risk data analysis. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/8206 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.600478


University of Illinois – Urbana-Champaign

8. Kim, Hee-Seok. Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures.

Degree: PhD, Electrical & Computer Engineering, 2015, University of Illinois – Urbana-Champaign

 The rising pressure to simultaneously improve performance and reduce power consumption is driving more heterogeneity into all aspects of computing devices. However, wide adoption of… (more)

Subjects/Keywords: OpenCL; compiler; Central Processing Unit (CPU); performance portability; data locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, H. (2015). Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88987

Chicago Manual of Style (16th Edition):

Kim, Hee-Seok. “Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 13, 2021. http://hdl.handle.net/2142/88987.

MLA Handbook (7th Edition):

Kim, Hee-Seok. “Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures.” 2015. Web. 13 Apr 2021.

Vancouver:

Kim H. Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2142/88987.

Council of Science Editors:

Kim H. Compiler and runtime techniques for bulk-synchronous programming models on CPU architectures. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88987


Georgia State University

9. Wu, Xiaolong. Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform.

Degree: MS, Computer Science, 2015, Georgia State University

  Sparse Matrix-Matrix multiplication (SpMM) is a fundamental operation over irregular data, which is widely used in graph algorithms, such as finding minimum spanning trees… (more)

Subjects/Keywords: Sparse matrix-matrix multiplication; Data locality; Pipelining; GPU

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, X. (2015). Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_theses/84

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wu, Xiaolong. “Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform.” 2015. Thesis, Georgia State University. Accessed April 13, 2021. https://scholarworks.gsu.edu/cs_theses/84.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wu, Xiaolong. “Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform.” 2015. Web. 13 Apr 2021.

Vancouver:

Wu X. Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform. [Internet] [Thesis]. Georgia State University; 2015. [cited 2021 Apr 13]. Available from: https://scholarworks.gsu.edu/cs_theses/84.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu X. Optimizing Sparse Matrix-Matrix Multiplication on a Heterogeneous CPU-GPU Platform. [Thesis]. Georgia State University; 2015. Available from: https://scholarworks.gsu.edu/cs_theses/84

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

10. Xie, Qiaomin. Routing and scheduling for cloud service data centers.

Degree: MS, 1200, 2013, University of Illinois – Urbana-Champaign

 In recent years, an increasing variety of dynamic-content web services, such as search, social networking and on-line commerce, have been moved to the Cloud service… (more)

Subjects/Keywords: Cloud service data center; load balancing; queueing analysis; task assignment; data locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xie, Q. (2013). Routing and scheduling for cloud service data centers. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42168

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xie, Qiaomin. “Routing and scheduling for cloud service data centers.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed April 13, 2021. http://hdl.handle.net/2142/42168.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xie, Qiaomin. “Routing and scheduling for cloud service data centers.” 2013. Web. 13 Apr 2021.

Vancouver:

Xie Q. Routing and scheduling for cloud service data centers. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2142/42168.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xie Q. Routing and scheduling for cloud service data centers. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42168

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Colorado State University

11. Dinkins, Stephanie. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.

Degree: MS(M.S.), Computer Science, 2012, Colorado State University

 Sparse matrix vector multiply (SpMV) is an important computation that is used in many scientific and structural engineering applications. Sparse computations like SpMV require the… (more)

Subjects/Keywords: data locality; Manhattan distance; performance model; sparse matrices; sparse matrix vector multiply; SpMV

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dinkins, S. (2012). Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/65303

Chicago Manual of Style (16th Edition):

Dinkins, Stephanie. “Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.” 2012. Masters Thesis, Colorado State University. Accessed April 13, 2021. http://hdl.handle.net/10217/65303.

MLA Handbook (7th Edition):

Dinkins, Stephanie. “Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.” 2012. Web. 13 Apr 2021.

Vancouver:

Dinkins S. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. [Internet] [Masters thesis]. Colorado State University; 2012. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10217/65303.

Council of Science Editors:

Dinkins S. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. [Masters Thesis]. Colorado State University; 2012. Available from: http://hdl.handle.net/10217/65303


Colorado State University

12. Gharaibeh, Manaf. Characterizing the visible address space to enable efficient continuous IP geolocation.

Degree: PhD, Computer Science, 2020, Colorado State University

 Internet Protocol (IP) geolocation is vital for location-dependent applications and many network research problems. The benefits to applications include enabling content customization, proximal server selection,… (more)

Subjects/Keywords: co-locality; IP geolocation; → network measurement; Internet measurement; active data analysis; mobile networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gharaibeh, M. (2020). Characterizing the visible address space to enable efficient continuous IP geolocation. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/208540

Chicago Manual of Style (16th Edition):

Gharaibeh, Manaf. “Characterizing the visible address space to enable efficient continuous IP geolocation.” 2020. Doctoral Dissertation, Colorado State University. Accessed April 13, 2021. http://hdl.handle.net/10217/208540.

MLA Handbook (7th Edition):

Gharaibeh, Manaf. “Characterizing the visible address space to enable efficient continuous IP geolocation.” 2020. Web. 13 Apr 2021.

Vancouver:

Gharaibeh M. Characterizing the visible address space to enable efficient continuous IP geolocation. [Internet] [Doctoral dissertation]. Colorado State University; 2020. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10217/208540.

Council of Science Editors:

Gharaibeh M. Characterizing the visible address space to enable efficient continuous IP geolocation. [Doctoral Dissertation]. Colorado State University; 2020. Available from: http://hdl.handle.net/10217/208540


Rice University

13. Sharma, Kamal Gopal. Locality Transformations of Computation and Data for Portable Performance.

Degree: PhD, Engineering, 2014, Rice University

 Recently, multi-cores chips have become omnipresent in computer systems ranging from high-end servers to mobile phones. A variety of multi-core architectures have been developed which… (more)

Subjects/Keywords: Locality Transformations; Cache Optimization; Tile size selection; Data Layout Optimization; Performance; Distributed Function Selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sharma, K. G. (2014). Locality Transformations of Computation and Data for Portable Performance. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/88159

Chicago Manual of Style (16th Edition):

Sharma, Kamal Gopal. “Locality Transformations of Computation and Data for Portable Performance.” 2014. Doctoral Dissertation, Rice University. Accessed April 13, 2021. http://hdl.handle.net/1911/88159.

MLA Handbook (7th Edition):

Sharma, Kamal Gopal. “Locality Transformations of Computation and Data for Portable Performance.” 2014. Web. 13 Apr 2021.

Vancouver:

Sharma KG. Locality Transformations of Computation and Data for Portable Performance. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1911/88159.

Council of Science Editors:

Sharma KG. Locality Transformations of Computation and Data for Portable Performance. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/88159


Rice University

14. Chatterjee, Sanjay. Runtime Systems for Extreme Scale Platforms.

Degree: PhD, Engineering, 2013, Rice University

 Future extreme-scale systems are expected to contain homogeneous and heterogeneous many-core processors, with O(103) cores per node and O(106) nodes overall. Effective combination of inter… (more)

Subjects/Keywords: Task parallelism; Data-flow; Runtime; Extreme-scale; Exascale; Communications; Locality; Tuning; Phaser; Synchronization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chatterjee, S. (2013). Runtime Systems for Extreme Scale Platforms. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/76173

Chicago Manual of Style (16th Edition):

Chatterjee, Sanjay. “Runtime Systems for Extreme Scale Platforms.” 2013. Doctoral Dissertation, Rice University. Accessed April 13, 2021. http://hdl.handle.net/1911/76173.

MLA Handbook (7th Edition):

Chatterjee, Sanjay. “Runtime Systems for Extreme Scale Platforms.” 2013. Web. 13 Apr 2021.

Vancouver:

Chatterjee S. Runtime Systems for Extreme Scale Platforms. [Internet] [Doctoral dissertation]. Rice University; 2013. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1911/76173.

Council of Science Editors:

Chatterjee S. Runtime Systems for Extreme Scale Platforms. [Doctoral Dissertation]. Rice University; 2013. Available from: http://hdl.handle.net/1911/76173


Rice University

15. Chatterjee, Sanjay. Runtime Models for Extreme Scale Systems.

Degree: PhD, Engineering, 2013, Rice University

 Future extreme-scale systems are expected to contain homogeneous and heterogeneous many-core processors, with up to O(103) cores per node and O(106) nodes overall. Effective combination… (more)

Subjects/Keywords: Task parallelism; Data-flow; Runtime; Extreme-scale; Exascale; Communications; Locality; Tuning; Phaser; Synchronization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chatterjee, S. (2013). Runtime Models for Extreme Scale Systems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/76416

Chicago Manual of Style (16th Edition):

Chatterjee, Sanjay. “Runtime Models for Extreme Scale Systems.” 2013. Doctoral Dissertation, Rice University. Accessed April 13, 2021. http://hdl.handle.net/1911/76416.

MLA Handbook (7th Edition):

Chatterjee, Sanjay. “Runtime Models for Extreme Scale Systems.” 2013. Web. 13 Apr 2021.

Vancouver:

Chatterjee S. Runtime Models for Extreme Scale Systems. [Internet] [Doctoral dissertation]. Rice University; 2013. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1911/76416.

Council of Science Editors:

Chatterjee S. Runtime Models for Extreme Scale Systems. [Doctoral Dissertation]. Rice University; 2013. Available from: http://hdl.handle.net/1911/76416


University of Southern California

16. Behnam, Ehsan. Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale.

Degree: PhD, Computational Biology and Bioinformatics, 2015, University of Southern California

 Recent advances in high-throughput sequencing technologies have provided scientists with unprecedented abilities to unravel the secrets of nature. Substantial cost reduction in such technologies has… (more)

Subjects/Keywords: next generation sequencing; alignment-free sequence comparison; data structures; locality sensitive hashing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Behnam, E. (2015). Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/541361/rec/3033

Chicago Manual of Style (16th Edition):

Behnam, Ehsan. “Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale.” 2015. Doctoral Dissertation, University of Southern California. Accessed April 13, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/541361/rec/3033.

MLA Handbook (7th Edition):

Behnam, Ehsan. “Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale.” 2015. Web. 13 Apr 2021.

Vancouver:

Behnam E. Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale. [Internet] [Doctoral dissertation]. University of Southern California; 2015. [cited 2021 Apr 13]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/541361/rec/3033.

Council of Science Editors:

Behnam E. Geometric interpretation of biological data: algorithmic solutions for next generation sequencing analysis at massive scale. [Doctoral Dissertation]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/541361/rec/3033


Georgia Tech

17. Palanisamy, Balaji. Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms.

Degree: PhD, Computer Science, 2013, Georgia Tech

 Cloud Computing represents a recent paradigm shift that enables users to share and remotely access high-powered computing resources (both infrastructure and software/services) contained in off-site… (more)

Subjects/Keywords: Cloud computing; MapReduce; Big data; Cost-optimization; Locality-awareness; Caching; System privacy; Location privacy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Palanisamy, B. (2013). Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52157

Chicago Manual of Style (16th Edition):

Palanisamy, Balaji. “Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed April 13, 2021. http://hdl.handle.net/1853/52157.

MLA Handbook (7th Edition):

Palanisamy, Balaji. “Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms.” 2013. Web. 13 Apr 2021.

Vancouver:

Palanisamy B. Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1853/52157.

Council of Science Editors:

Palanisamy B. Cost-effective and privacy-conscious cloud service provisioning: architectures and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/52157

18. Srinivasan, Priyaa Varshinee. Improving Data Locality in Applications using Message Passing.

Degree: 2014, University of Waterloo

 This thesis presents a systematic study of two modes of program execution: synchronous and asynchronous. In synchronous mode, program components are tightly coupled. Traditional procedure… (more)

Subjects/Keywords: Data locality; Message Passing; Cache

…of components. The increase in the reuse distance affects the temporal locality of data… …distance affects the temporal locality of the data element d. The synchronous execution mode… …time and space to improve the temporal locality of data. 2.3.1 Temporal reorganization of… …look-up operation for each request. The temporal locality of data in such a program can be… …improves the temporal locality of data in the program. Temporal reorganization is relevant to… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Srinivasan, P. V. (2014). Improving Data Locality in Applications using Message Passing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Srinivasan, Priyaa Varshinee. “Improving Data Locality in Applications using Message Passing.” 2014. Thesis, University of Waterloo. Accessed April 13, 2021. http://hdl.handle.net/10012/8965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Srinivasan, Priyaa Varshinee. “Improving Data Locality in Applications using Message Passing.” 2014. Web. 13 Apr 2021.

Vancouver:

Srinivasan PV. Improving Data Locality in Applications using Message Passing. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10012/8965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Srinivasan PV. Improving Data Locality in Applications using Message Passing. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New South Wales

19. Sunarso, Freddie. Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce.

Degree: Computer Science & Engineering, 2014, University of New South Wales

 Metagenomic studies produce large datasets that are estimated to grow at a faster rate than the available computational capacity. A key step in the metagenomic… (more)

Subjects/Keywords: Protein Sequence Similarity Search; Locality-Sensitive Hashing; MapReduce; Big Data; Cloud Computing; Metagenomics; ScalLoPS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sunarso, F. (2014). Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53681 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12376/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Sunarso, Freddie. “Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce.” 2014. Masters Thesis, University of New South Wales. Accessed April 13, 2021. http://handle.unsw.edu.au/1959.4/53681 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12376/SOURCE02?view=true.

MLA Handbook (7th Edition):

Sunarso, Freddie. “Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce.” 2014. Web. 13 Apr 2021.

Vancouver:

Sunarso F. Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce. [Internet] [Masters thesis]. University of New South Wales; 2014. [cited 2021 Apr 13]. Available from: http://handle.unsw.edu.au/1959.4/53681 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12376/SOURCE02?view=true.

Council of Science Editors:

Sunarso F. Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce. [Masters Thesis]. University of New South Wales; 2014. Available from: http://handle.unsw.edu.au/1959.4/53681 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12376/SOURCE02?view=true


The Ohio State University

20. Lu, Qingda. Data Layout Optimization Techniques for Modern and Emerging Architectures.

Degree: PhD, Computer Science and Engineering, 2008, The Ohio State University

  The never-ending pursuit of higher performance is one fundamental driving force of computer science research. Although the semiconductor industry has fulfilled Moore’s Law over… (more)

Subjects/Keywords: Computer Science; performance; optimization; data Layout; data locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lu, Q. (2008). Data Layout Optimization Techniques for Modern and Emerging Architectures. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1228324157

Chicago Manual of Style (16th Edition):

Lu, Qingda. “Data Layout Optimization Techniques for Modern and Emerging Architectures.” 2008. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1228324157.

MLA Handbook (7th Edition):

Lu, Qingda. “Data Layout Optimization Techniques for Modern and Emerging Architectures.” 2008. Web. 13 Apr 2021.

Vancouver:

Lu Q. Data Layout Optimization Techniques for Modern and Emerging Architectures. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1228324157.

Council of Science Editors:

Lu Q. Data Layout Optimization Techniques for Modern and Emerging Architectures. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1228324157


Iowa State University

21. Venkatesan, Varun Kumhar. Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment.

Degree: 2015, Iowa State University

 Processor hardware has been architected with the assumption that most data access patterns would be linearly spatial in nature. But, most applications involve algorithms that… (more)

Subjects/Keywords: Computer Engineering; Data Shapers; Dynamic Binary Optimization; Performance optimization; Spatial locality; Time and Energy; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Venkatesan, V. K. (2015). Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/14725

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Venkatesan, Varun Kumhar. “Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment.” 2015. Thesis, Iowa State University. Accessed April 13, 2021. https://lib.dr.iastate.edu/etd/14725.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Venkatesan, Varun Kumhar. “Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment.” 2015. Web. 13 Apr 2021.

Vancouver:

Venkatesan VK. Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment. [Internet] [Thesis]. Iowa State University; 2015. [cited 2021 Apr 13]. Available from: https://lib.dr.iastate.edu/etd/14725.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Venkatesan VK. Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment. [Thesis]. Iowa State University; 2015. Available from: https://lib.dr.iastate.edu/etd/14725

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Vaumourin, Gregory. Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System.

Degree: Docteur es, Informatique, 2016, Bordeaux

Les problématiques de consommation dans la hiérarchie mémoire sont très présentes dans les architectures actuelles que ce soit pour les systèmes embarqués limités par leurs… (more)

Subjects/Keywords: Hiérarchie mémoire; Protocoles de cohérence; Localité des données; Cache; Memory System; Coherence protocol; Data locality; Cache Memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vaumourin, G. (2016). Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2016BORD0173

Chicago Manual of Style (16th Edition):

Vaumourin, Gregory. “Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System.” 2016. Doctoral Dissertation, Bordeaux. Accessed April 13, 2021. http://www.theses.fr/2016BORD0173.

MLA Handbook (7th Edition):

Vaumourin, Gregory. “Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System.” 2016. Web. 13 Apr 2021.

Vancouver:

Vaumourin G. Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System. [Internet] [Doctoral dissertation]. Bordeaux; 2016. [cited 2021 Apr 13]. Available from: http://www.theses.fr/2016BORD0173.

Council of Science Editors:

Vaumourin G. Gestion hétérogène des données dans les hiérarchies mémoires pour l’optimisation énergétique des architectures multi-coeurs : Read Only Data Specific Management for an Energy Efficient Memory System. [Doctoral Dissertation]. Bordeaux; 2016. Available from: http://www.theses.fr/2016BORD0173

23. Jin, Xin. Multi-Version Search and Cache-Conscious Ranking Optimization.

Degree: 2017, University of California – eScholarship, University of California

 Organizations and companies archive many versions of digital data such as web pages, internal emails and so on. Such data is critical for internal investigation,… (more)

Subjects/Keywords: Computer science; cache locality; ensemble methods; positional inverted index; query processing; search in document archives; versioned data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jin, X. (2017). Multi-Version Search and Cache-Conscious Ranking Optimization. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/6c9477tt

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jin, Xin. “Multi-Version Search and Cache-Conscious Ranking Optimization.” 2017. Thesis, University of California – eScholarship, University of California. Accessed April 13, 2021. http://www.escholarship.org/uc/item/6c9477tt.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jin, Xin. “Multi-Version Search and Cache-Conscious Ranking Optimization.” 2017. Web. 13 Apr 2021.

Vancouver:

Jin X. Multi-Version Search and Cache-Conscious Ranking Optimization. [Internet] [Thesis]. University of California – eScholarship, University of California; 2017. [cited 2021 Apr 13]. Available from: http://www.escholarship.org/uc/item/6c9477tt.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jin X. Multi-Version Search and Cache-Conscious Ranking Optimization. [Thesis]. University of California – eScholarship, University of California; 2017. Available from: http://www.escholarship.org/uc/item/6c9477tt

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

24. Yeom, Jae-seung. Optimizing Data Accesses for Scaling Data-intensive Scientific Applications.

Degree: PhD, Computer Science and Applications, 2014, Virginia Tech

Data-intensive scientific applications often process an enormous amount of data. The scalability of such applications depends critically on how to manage the locality of data.… (more)

Subjects/Keywords: Parallel systems; Software-managed memories; Distributed memories; Data locality; Scalability; Parallel discrete event simulation; Social networks; Contagion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yeom, J. (2014). Optimizing Data Accesses for Scaling Data-intensive Scientific Applications. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/64180

Chicago Manual of Style (16th Edition):

Yeom, Jae-seung. “Optimizing Data Accesses for Scaling Data-intensive Scientific Applications.” 2014. Doctoral Dissertation, Virginia Tech. Accessed April 13, 2021. http://hdl.handle.net/10919/64180.

MLA Handbook (7th Edition):

Yeom, Jae-seung. “Optimizing Data Accesses for Scaling Data-intensive Scientific Applications.” 2014. Web. 13 Apr 2021.

Vancouver:

Yeom J. Optimizing Data Accesses for Scaling Data-intensive Scientific Applications. [Internet] [Doctoral dissertation]. Virginia Tech; 2014. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10919/64180.

Council of Science Editors:

Yeom J. Optimizing Data Accesses for Scaling Data-intensive Scientific Applications. [Doctoral Dissertation]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/64180


The Ohio State University

25. Krishnamoorthy, Sriram. Optimizing locality and parallelism through program reorganization.

Degree: PhD, Computer and Information Science, 2008, The Ohio State University

 Development of scalable application codes requires an understanding and exploitation of the locality and parallelism in the computation. This is typically achieved through optimizations by… (more)

Subjects/Keywords: Computer Science; data locality; parallelization; out-of-core

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krishnamoorthy, S. (2008). Optimizing locality and parallelism through program reorganization. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1197913392

Chicago Manual of Style (16th Edition):

Krishnamoorthy, Sriram. “Optimizing locality and parallelism through program reorganization.” 2008. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1197913392.

MLA Handbook (7th Edition):

Krishnamoorthy, Sriram. “Optimizing locality and parallelism through program reorganization.” 2008. Web. 13 Apr 2021.

Vancouver:

Krishnamoorthy S. Optimizing locality and parallelism through program reorganization. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1197913392.

Council of Science Editors:

Krishnamoorthy S. Optimizing locality and parallelism through program reorganization. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1197913392


The Ohio State University

26. Khanna, Gaurav. A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing.

Degree: PhD, Computer Science and Engineering, 2008, The Ohio State University

  Science is increasingly becoming more and more data-driven. With technologicaladvancements such as advanced sensing technologies that can rapidly capturedata at high resolutions and Grid… (more)

Subjects/Keywords: Computer Science; Mapping; Scheduling; Data Locality; Grids

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Khanna, G. (2008). A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1218559278

Chicago Manual of Style (16th Edition):

Khanna, Gaurav. “A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing.” 2008. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218559278.

MLA Handbook (7th Edition):

Khanna, Gaurav. “A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing.” 2008. Web. 13 Apr 2021.

Vancouver:

Khanna G. A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218559278.

Council of Science Editors:

Khanna G. A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218559278


University of Helsinki

27. Raatikka, Vilho. Cache-Conscious Index Structures for Main-Memory Databases.

Degree: Department of Computer Science; Helsingfors universitet, Matematisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap, 2004, University of Helsinki

Subjects/Keywords: access method; cache consciousness; data locality; data structure; main-memory database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raatikka, V. (2004). Cache-Conscious Index Structures for Main-Memory Databases. (Masters Thesis). University of Helsinki. Retrieved from http://hdl.handle.net/10138/21429

Chicago Manual of Style (16th Edition):

Raatikka, Vilho. “Cache-Conscious Index Structures for Main-Memory Databases.” 2004. Masters Thesis, University of Helsinki. Accessed April 13, 2021. http://hdl.handle.net/10138/21429.

MLA Handbook (7th Edition):

Raatikka, Vilho. “Cache-Conscious Index Structures for Main-Memory Databases.” 2004. Web. 13 Apr 2021.

Vancouver:

Raatikka V. Cache-Conscious Index Structures for Main-Memory Databases. [Internet] [Masters thesis]. University of Helsinki; 2004. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10138/21429.

Council of Science Editors:

Raatikka V. Cache-Conscious Index Structures for Main-Memory Databases. [Masters Thesis]. University of Helsinki; 2004. Available from: http://hdl.handle.net/10138/21429

28. Nafziger, Jonathan W. A Novel Cache Migration Scheme in Network-on-Chip Devices.

Degree: MS, Engineering and Applied Science: Computer Engineering, 2010, University of Cincinnati

  Future Network-on-Chip (NoC) designs no longer map single cores to each cache slice but rather multiple cores in layouts known as hybrid architectures. Additional… (more)

Subjects/Keywords: Electrical Engineering; Network-on-chip; NoC; Cache; Data Migration; Spatial Locality; Temporal Locality

…on temporal locality using previous usage patterns in an attempt to move data closer to its… …also take into account data spatial locality. This rule states that given Linei has been used… …If lines are migrated early due to considerations for data spatial locality and used by the… …Migration Threshold . . . 4.5 Effect of Message Processing Speed 4.6 Effect of Data Search Method… …Mean Cycle Access Time for Varying Data Searches Mean Hops per Access for Varying Data… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nafziger, J. W. (2010). A Novel Cache Migration Scheme in Network-on-Chip Devices. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282327354

Chicago Manual of Style (16th Edition):

Nafziger, Jonathan W. “A Novel Cache Migration Scheme in Network-on-Chip Devices.” 2010. Masters Thesis, University of Cincinnati. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282327354.

MLA Handbook (7th Edition):

Nafziger, Jonathan W. “A Novel Cache Migration Scheme in Network-on-Chip Devices.” 2010. Web. 13 Apr 2021.

Vancouver:

Nafziger JW. A Novel Cache Migration Scheme in Network-on-Chip Devices. [Internet] [Masters thesis]. University of Cincinnati; 2010. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282327354.

Council of Science Editors:

Nafziger JW. A Novel Cache Migration Scheme in Network-on-Chip Devices. [Masters Thesis]. University of Cincinnati; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282327354

29. Lezos, Christakis. Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης.

Degree: 2018, University of Peloponesse; Πανεπιστήμιο Πελοποννήσου

This Ph.D. dissertation discusses a software profiling and optimization tool that infers source code optimizations for algorithms implemented in high level languages like C and… (more)

Subjects/Keywords: Απόσταση επαναχρησιμοποιήσης δεδομένων; Βελτιστοποίηση τοπικότητας αναφοράς δεδομένων; Μετασχηματισμοί βρόχων επανάληψης; Μεταγλωττιστές; Αυτόματη παραγωγή κώδικα; Reuse distance analysis; Data locality optimization; Source-to-source optimizing transformations; Compiler generators; source code analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lezos, C. (2018). Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης. (Thesis). University of Peloponesse; Πανεπιστήμιο Πελοποννήσου. Retrieved from http://hdl.handle.net/10442/hedi/45200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lezos, Christakis. “Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης.” 2018. Thesis, University of Peloponesse; Πανεπιστήμιο Πελοποννήσου. Accessed April 13, 2021. http://hdl.handle.net/10442/hedi/45200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lezos, Christakis. “Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης.” 2018. Web. 13 Apr 2021.

Vancouver:

Lezos C. Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης. [Internet] [Thesis]. University of Peloponesse; Πανεπιστήμιο Πελοποννήσου; 2018. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10442/hedi/45200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lezos C. Ανάλυση της απόστασης επαναχρησιμοποίησης δεδομένων σε επίπεδο πηγαίου κώδικα για την βελτιστοποίηση της τοπικότητας αναφοράς σε αλγορίθμους όπου κυριαρχούν βρόχοι επανάληψης. [Thesis]. University of Peloponesse; Πανεπιστήμιο Πελοποννήσου; 2018. Available from: http://hdl.handle.net/10442/hedi/45200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Queens University

30. Elshater, Yehia. Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments .

Degree: Computing, Queens University

 With the explosion of data that are generated every second, there is an emerging need for big data analytics using scalable systems and platforms for… (more)

Subjects/Keywords: YARN ; Hadoop ; Data Locality ; Simulation ; Dynamic Replication ; Load Balancing ; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Elshater, Y. (n.d.). Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/15890

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Elshater, Yehia. “Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments .” Thesis, Queens University. Accessed April 13, 2021. http://hdl.handle.net/1974/15890.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Elshater, Yehia. “Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments .” Web. 13 Apr 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Elshater Y. Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments . [Internet] [Thesis]. Queens University; [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1974/15890.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Elshater Y. Optimizing Data Locality in Analytic Workloads over Distributed Computing Environments . [Thesis]. Queens University; Available from: http://hdl.handle.net/1974/15890

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

[1] [2]

.