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 +publisher:"The Ohio State University" +contributor:("Sadayappan, P"). Showing records 1 – 27 of 27 total matches.

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


The Ohio State University

1. Islam, Mohammad Kamrul. QoS In Parallel Job Scheduling.

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

  Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources to improve the performance… (more)

Subjects/Keywords: Computer Science; Job Scheduling; QoS; High performance computing; Revenue

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Islam, M. K. (2008). QoS In Parallel Job Scheduling. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682

Chicago Manual of Style (16th Edition):

Islam, Mohammad Kamrul. “QoS In Parallel Job Scheduling.” 2008. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682.

MLA Handbook (7th Edition):

Islam, Mohammad Kamrul. “QoS In Parallel Job Scheduling.” 2008. Web. 15 Jan 2019.

Vancouver:

Islam MK. QoS In Parallel Job Scheduling. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682.

Council of Science Editors:

Islam MK. QoS In Parallel Job Scheduling. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682


The Ohio State University

2. 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 January 15, 2019. 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. 15 Jan 2019.

Vancouver:

Lu Q. Data Layout Optimization Techniques for Modern and Emerging Architectures. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Jan 15]. 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


The Ohio State University

3. Ali, Nawab. Rethinking I/O in High-Performance Computing Environments.

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

 As the types of problems we solve in high-performance computing and other areas become more complex, the amount of data generated and used is growing… (more)

Subjects/Keywords: Computer Science; High-performance I/O; Parallel file systems; Leadership-class machines; Remote I/O; High-performance computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ali, N. (2009). Rethinking I/O in High-Performance Computing Environments. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1259094051

Chicago Manual of Style (16th Edition):

Ali, Nawab. “Rethinking I/O in High-Performance Computing Environments.” 2009. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1259094051.

MLA Handbook (7th Edition):

Ali, Nawab. “Rethinking I/O in High-Performance Computing Environments.” 2009. Web. 15 Jan 2019.

Vancouver:

Ali N. Rethinking I/O in High-Performance Computing Environments. [Internet] [Doctoral dissertation]. The Ohio State University; 2009. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259094051.

Council of Science Editors:

Ali N. Rethinking I/O in High-Performance Computing Environments. [Doctoral Dissertation]. The Ohio State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259094051


The Ohio State University

4. 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 January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1197913392.

MLA Handbook (7th Edition):

Krishnamoorthy, Sriram. “Optimizing locality and parallelism through program reorganization.” 2008. Web. 15 Jan 2019.

Vancouver:

Krishnamoorthy S. Optimizing locality and parallelism through program reorganization. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Jan 15]. 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

5. Larkins, Darrell Brian. Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems.

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

  Developing high-performance parallel applications that use linkeddata structures on distributed-memory clusters is challenging. Manyscientific applications use algorithms based on linked datastructures like trees and… (more)

Subjects/Keywords: Computer Science; pgas; trees; graphs; distributed memory; high performance computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Larkins, D. B. (2010). Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1280519762

Chicago Manual of Style (16th Edition):

Larkins, Darrell Brian. “Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems.” 2010. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1280519762.

MLA Handbook (7th Edition):

Larkins, Darrell Brian. “Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems.” 2010. Web. 15 Jan 2019.

Vancouver:

Larkins DB. Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems. [Internet] [Doctoral dissertation]. The Ohio State University; 2010. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1280519762.

Council of Science Editors:

Larkins DB. Efficient Run-time Support For Global View Programming of Linked Data Structures on Distributed Memory Parallel Systems. [Doctoral Dissertation]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1280519762


The Ohio State University

6. Ravishankar, Mahesh. Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns.

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

 With the era of increasing clock speeds coming to an end, parallelcomputing architectures have now become main-stream. Due to the widerange of architectures available today… (more)

Subjects/Keywords: Computer Engineering; Distributed Memory, Inspector-Executor, DSL, Image Processing, Irregular Computations, Compiler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ravishankar, M. (2014). Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1400085733

Chicago Manual of Style (16th Edition):

Ravishankar, Mahesh. “Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1400085733.

MLA Handbook (7th Edition):

Ravishankar, Mahesh. “Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns.” 2014. Web. 15 Jan 2019.

Vancouver:

Ravishankar M. Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1400085733.

Council of Science Editors:

Ravishankar M. Automatic Parallelization of Loops with Data Dependent Control Flow and Array Access Patterns. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1400085733


The Ohio State University

7. Tavarageri, Sanket. Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience.

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

 The technology trends have brought parallel computers — multi-core and many-coreprocessors to the mainstream. Parallel computing presents formidable challenges for compilersfrom performance and energy view-points:… (more)

Subjects/Keywords: Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tavarageri, S. (2014). Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1397493916

Chicago Manual of Style (16th Edition):

Tavarageri, Sanket. “Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397493916.

MLA Handbook (7th Edition):

Tavarageri, Sanket. “Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience.” 2014. Web. 15 Jan 2019.

Vancouver:

Tavarageri S. Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397493916.

Council of Science Editors:

Tavarageri S. Compiler Techniques for High Performance Computing, Energy Efficiency, and Resilience. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397493916


The Ohio State University

8. Lai, Pai-Wei. A Framework for Performance Optimization of TensorContraction Expressions.

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

 Attaining high performance and productivity in the evaluation of scientific applications is a challenging task for computer scientists, and is often critical in the advancement… (more)

Subjects/Keywords: Computer Science; tensor contraction; operation minimization; dynamic load-balancing; caching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, P. (2014). A Framework for Performance Optimization of TensorContraction Expressions. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1408968185

Chicago Manual of Style (16th Edition):

Lai, Pai-Wei. “A Framework for Performance Optimization of TensorContraction Expressions.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1408968185.

MLA Handbook (7th Edition):

Lai, Pai-Wei. “A Framework for Performance Optimization of TensorContraction Expressions.” 2014. Web. 15 Jan 2019.

Vancouver:

Lai P. A Framework for Performance Optimization of TensorContraction Expressions. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408968185.

Council of Science Editors:

Lai P. A Framework for Performance Optimization of TensorContraction Expressions. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408968185


The Ohio State University

9. Henretty, Thomas Steel. Performance Optimization of Stencil Computations on Modern SIMD Architectures.

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

 Performance of scientific computing codes on modern high-performance computing(HPC) systems has, in some cases, not achieved a significant percentage of thesystem’s peak performance. Three of… (more)

Subjects/Keywords: Computer Science; stencil; SIMD; PDE; DLT; SDSL; domain specific language; stream alignment conflict; split tiling; nested split tiling; hybrid split tiling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henretty, T. S. (2014). Performance Optimization of Stencil Computations on Modern SIMD Architectures. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1408937226

Chicago Manual of Style (16th Edition):

Henretty, Thomas Steel. “Performance Optimization of Stencil Computations on Modern SIMD Architectures.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1408937226.

MLA Handbook (7th Edition):

Henretty, Thomas Steel. “Performance Optimization of Stencil Computations on Modern SIMD Architectures.” 2014. Web. 15 Jan 2019.

Vancouver:

Henretty TS. Performance Optimization of Stencil Computations on Modern SIMD Architectures. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408937226.

Council of Science Editors:

Henretty TS. Performance Optimization of Stencil Computations on Modern SIMD Architectures. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408937226

10. Arafat, Md Humayun. Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems.

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

 Exascale computing creates many challenges for scientific applications in both hardware and software. There is a continuous need for adaption to new architectures. Load balancing… (more)

Subjects/Keywords: Computer Science; Task Parallel model, CPU-GPU, Fault Tolerance, Load Balancing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arafat, M. H. (2014). Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1408972218

Chicago Manual of Style (16th Edition):

Arafat, Md Humayun. “Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1408972218.

MLA Handbook (7th Edition):

Arafat, Md Humayun. “Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems.” 2014. Web. 15 Jan 2019.

Vancouver:

Arafat MH. Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408972218.

Council of Science Editors:

Arafat MH. Runtime Systems for Load Balancing and Fault Tolerance on Distributed Systems. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408972218


The Ohio State University

11. Kumar, Vijay Shiv. Specification, Configuration and Execution of Data-intensive Scientific Applications.

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

  Recent advances in digital sensor technology and numerical simulationsof real-world phenomena are resulting in the acquisition of unprecedentedamounts of raw digital data. Terms like… (more)

Subjects/Keywords: Computer Science; data-intensive computing; high performance computing; scientific workflow; out-of-core; multi-dimensional data; semantic modeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, V. S. (2010). Specification, Configuration and Execution of Data-intensive Scientific Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1286570224

Chicago Manual of Style (16th Edition):

Kumar, Vijay Shiv. “Specification, Configuration and Execution of Data-intensive Scientific Applications.” 2010. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1286570224.

MLA Handbook (7th Edition):

Kumar, Vijay Shiv. “Specification, Configuration and Execution of Data-intensive Scientific Applications.” 2010. Web. 15 Jan 2019.

Vancouver:

Kumar VS. Specification, Configuration and Execution of Data-intensive Scientific Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2010. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1286570224.

Council of Science Editors:

Kumar VS. Specification, Configuration and Execution of Data-intensive Scientific Applications. [Doctoral Dissertation]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1286570224


The Ohio State University

12. Maddipati, Sai Ratna Kiran. Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer.

Degree: MS, Computer Science and Engineering, 2016, The Ohio State University

 In a thermodynamically unstable environment, the Boltzman-Transport Equation (BTE) defines the behavior of heat transfer-rate at each location in the environment, the direction of heat… (more)

Subjects/Keywords: Computer Science; Parallel Computing, OpenMP, MPI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maddipati, S. R. K. (2016). Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523

Chicago Manual of Style (16th Edition):

Maddipati, Sai Ratna Kiran. “Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer.” 2016. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523.

MLA Handbook (7th Edition):

Maddipati, Sai Ratna Kiran. “Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer.” 2016. Web. 15 Jan 2019.

Vancouver:

Maddipati SRK. Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer. [Internet] [Masters thesis]. The Ohio State University; 2016. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523.

Council of Science Editors:

Maddipati SRK. Improving the Parallel Performance of Boltzman-Transport Equation for Heat Transfer. [Masters Thesis]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523


The Ohio State University

13. Shi, Bobo. Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator.

Degree: MS, Computer Science and Engineering, 2016, The Ohio State University

 CCSD(T), part of coupled cluster (CC) method, is one of the most accurate methods applicable to reasonably large molecules in computational chemistry field. The ability… (more)

Subjects/Keywords: Computer Science; CCSD-T; Xeon Phi Coprocessor; CUDA; GPU; tensor contraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shi, B. (2016). Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1462793739

Chicago Manual of Style (16th Edition):

Shi, Bobo. “Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator.” 2016. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1462793739.

MLA Handbook (7th Edition):

Shi, Bobo. “Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator.” 2016. Web. 15 Jan 2019.

Vancouver:

Shi B. Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator. [Internet] [Masters thesis]. The Ohio State University; 2016. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1462793739.

Council of Science Editors:

Shi B. Implementation and Performance Analysis of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor and NVIDIA GPU Accelerator. [Masters Thesis]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1462793739


The Ohio State University

14. Jhally, Gaganjit Singh. Sampling of Dynamic Dependence Graphs for Data Locality Analysis.

Degree: MS, Computer Science and Engineering, 2016, The Ohio State University

 Data locality is a critical factor which affects the execution time of applications today. With major advances being made in reducing the computation time of… (more)

Subjects/Keywords: Computer Science; Data movement costs, cache miss cost, time tiling technique, sampling, dynamic analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jhally, G. S. (2016). Sampling of Dynamic Dependence Graphs for Data Locality Analysis. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1462885420

Chicago Manual of Style (16th Edition):

Jhally, Gaganjit Singh. “Sampling of Dynamic Dependence Graphs for Data Locality Analysis.” 2016. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1462885420.

MLA Handbook (7th Edition):

Jhally, Gaganjit Singh. “Sampling of Dynamic Dependence Graphs for Data Locality Analysis.” 2016. Web. 15 Jan 2019.

Vancouver:

Jhally GS. Sampling of Dynamic Dependence Graphs for Data Locality Analysis. [Internet] [Masters thesis]. The Ohio State University; 2016. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1462885420.

Council of Science Editors:

Jhally GS. Sampling of Dynamic Dependence Graphs for Data Locality Analysis. [Masters Thesis]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1462885420


The Ohio State University

15. Sringeri Vageeswara, Abhijit. Tensor Contraction Optimizations.

Degree: MS, Computer Science and Engineering, 2015, The Ohio State University

 Tensor contractions are frequently encountered computationally expensive operations in the fields of Nuclear Physics, Quantum Chemistry, Fluid dynamics and other areas of computational science. Most… (more)

Subjects/Keywords: Computer Science; Tensor; Contraction; RRR; NWChem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sringeri Vageeswara, A. (2015). Tensor Contraction Optimizations. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1440399261

Chicago Manual of Style (16th Edition):

Sringeri Vageeswara, Abhijit. “Tensor Contraction Optimizations.” 2015. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1440399261.

MLA Handbook (7th Edition):

Sringeri Vageeswara, Abhijit. “Tensor Contraction Optimizations.” 2015. Web. 15 Jan 2019.

Vancouver:

Sringeri Vageeswara A. Tensor Contraction Optimizations. [Internet] [Masters thesis]. The Ohio State University; 2015. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1440399261.

Council of Science Editors:

Sringeri Vageeswara A. Tensor Contraction Optimizations. [Masters Thesis]. The Ohio State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1440399261


The Ohio State University

16. Ashari, Arash. Sparse Matrix-Vector Multiplication on GPU.

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

 Sparse Matrix-Vector multiplication (SpMV) is one of the key operations in linear algebra. Overcoming thread divergence, load imbalance and un-coalesced and indirect memory access due… (more)

Subjects/Keywords: Computer Engineering; Computer Science; GPU; CUDA; Sparse; SpMV; BRC; ACSR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ashari, A. (2014). Sparse Matrix-Vector Multiplication on GPU. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1417770100

Chicago Manual of Style (16th Edition):

Ashari, Arash. “Sparse Matrix-Vector Multiplication on GPU.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417770100.

MLA Handbook (7th Edition):

Ashari, Arash. “Sparse Matrix-Vector Multiplication on GPU.” 2014. Web. 15 Jan 2019.

Vancouver:

Ashari A. Sparse Matrix-Vector Multiplication on GPU. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1417770100.

Council of Science Editors:

Ashari A. Sparse Matrix-Vector Multiplication on GPU. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1417770100


The Ohio State University

17. Rajbhandari, Samyam. Locality Optimizations for Regular and Irregular Applications.

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

 The fastest supercomputer in the world as of July 2016 is the Sunway TaihuLight. It can achieve a staggering performance of 93 PetaFlops. This incredible… (more)

Subjects/Keywords: Computer Science; Computer Engineering; locality, tensors, tensor contractions, convolutional neural network, MADNESS, 4-index transform, k-d trees, recursive tree traversal, locality optimization, scalability, performance, optimizations, fusion, communication optimal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajbhandari, S. (2016). Locality Optimizations for Regular and Irregular Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1469033289

Chicago Manual of Style (16th Edition):

Rajbhandari, Samyam. “Locality Optimizations for Regular and Irregular Applications.” 2016. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1469033289.

MLA Handbook (7th Edition):

Rajbhandari, Samyam. “Locality Optimizations for Regular and Irregular Applications.” 2016. Web. 15 Jan 2019.

Vancouver:

Rajbhandari S. Locality Optimizations for Regular and Irregular Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2016. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1469033289.

Council of Science Editors:

Rajbhandari S. Locality Optimizations for Regular and Irregular Applications. [Doctoral Dissertation]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1469033289

18. Elango, Venmugil. Techniques for Characterizing the Data Movement Complexity of Computations.

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

 The execution cost of a program, both in terms of time and energy, comprises computational cost and data movement cost (e.g., cost of transferring data… (more)

Subjects/Keywords: Computer Science; High-Performance Computing; IO complexity; Data movement complexity; Data access complexity; Red-blue pebble game; Lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elango, V. (2016). Techniques for Characterizing the Data Movement Complexity of Computations. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1452242436

Chicago Manual of Style (16th Edition):

Elango, Venmugil. “Techniques for Characterizing the Data Movement Complexity of Computations.” 2016. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1452242436.

MLA Handbook (7th Edition):

Elango, Venmugil. “Techniques for Characterizing the Data Movement Complexity of Computations.” 2016. Web. 15 Jan 2019.

Vancouver:

Elango V. Techniques for Characterizing the Data Movement Complexity of Computations. [Internet] [Doctoral dissertation]. The Ohio State University; 2016. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1452242436.

Council of Science Editors:

Elango V. Techniques for Characterizing the Data Movement Complexity of Computations. [Doctoral Dissertation]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1452242436

19. Zhang, Huaijian. Utilization of Symmetry in Optimization of Tensor Contraction Expressions.

Degree: MS, Computer Science and Engineering, 2010, The Ohio State University

  Multi-dimensional tensor contractions arise extensively in quantum chemistry, incalculating the amplitudes and energy of the electron wave functions. Accordingto the Pauli Antisymmetry Principle, any… (more)

Subjects/Keywords: Computer Science; tensor contraction; symmetry; operation minimization; quantum chemistry; CCSD equation

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):

Zhang, H. (2010). Utilization of Symmetry in Optimization of Tensor Contraction Expressions. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1285047367

Chicago Manual of Style (16th Edition):

Zhang, Huaijian. “Utilization of Symmetry in Optimization of Tensor Contraction Expressions.” 2010. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1285047367.

MLA Handbook (7th Edition):

Zhang, Huaijian. “Utilization of Symmetry in Optimization of Tensor Contraction Expressions.” 2010. Web. 15 Jan 2019.

Vancouver:

Zhang H. Utilization of Symmetry in Optimization of Tensor Contraction Expressions. [Internet] [Masters thesis]. The Ohio State University; 2010. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1285047367.

Council of Science Editors:

Zhang H. Utilization of Symmetry in Optimization of Tensor Contraction Expressions. [Masters Thesis]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1285047367

20. Niu, Qingpeng. Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications.

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

 The rate of improvement in data access costs continues to lag behindthe improvement in computational rates. Therefore characterization andenhancement of data locality in applications is… (more)

Subjects/Keywords: Computer Science; Irregular applications; Program Locality; Load balancing; Performance Optimization; Reuse distance; Parallel Algorithm; Generalized sparse matrix-matrix multiplication; SpGEMM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Niu, Q. (2015). Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1420811652

Chicago Manual of Style (16th Edition):

Niu, Qingpeng. “Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications.” 2015. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1420811652.

MLA Handbook (7th Edition):

Niu, Qingpeng. “Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications.” 2015. Web. 15 Jan 2019.

Vancouver:

Niu Q. Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2015. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1420811652.

Council of Science Editors:

Niu Q. Characterization and Enhancement of Data Locality and Load Balancing for Irregular Applications. [Doctoral Dissertation]. The Ohio State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1420811652

21. Fauzia, Naznin. Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis.

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

 Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak processing rate to memory bandwidth), as highlighted by recent studies on Exascale architectural trends.… (more)

Subjects/Keywords: Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fauzia, N. (2015). Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1420759839

Chicago Manual of Style (16th Edition):

Fauzia, Naznin. “Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis.” 2015. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1420759839.

MLA Handbook (7th Edition):

Fauzia, Naznin. “Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis.” 2015. Web. 15 Jan 2019.

Vancouver:

Fauzia N. Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis. [Internet] [Doctoral dissertation]. The Ohio State University; 2015. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1420759839.

Council of Science Editors:

Fauzia N. Characterization of Data Locality Potential of CPU and GPU Applications through Dynamic Analysis. [Doctoral Dissertation]. The Ohio State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1420759839

22. Stock, Kevin Alan. Vectorization and Register Reuse in High Performance Computing.

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

 Automatic vectorization is crucial for attaining maximum performance onmodern processors in a performance portable fashion. There issignificant room for improvement over techniques in existing compilers,as… (more)

Subjects/Keywords: Computer Science; Computer Engineering; SIMD; High Performance Computing; Autovectorization; Tensor contractions; Stencils

…B.S.C.S.E. The Ohio State University January 2010 — Present… …Graduate Research Associate The Ohio State University July 2010 — September 2010… 

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):

Stock, K. A. (2014). Vectorization and Register Reuse in High Performance Computing. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1408969385

Chicago Manual of Style (16th Edition):

Stock, Kevin Alan. “Vectorization and Register Reuse in High Performance Computing.” 2014. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1408969385.

MLA Handbook (7th Edition):

Stock, Kevin Alan. “Vectorization and Register Reuse in High Performance Computing.” 2014. Web. 15 Jan 2019.

Vancouver:

Stock KA. Vectorization and Register Reuse in High Performance Computing. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408969385.

Council of Science Editors:

Stock KA. Vectorization and Register Reuse in High Performance Computing. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1408969385

23. Eisenlohr, John Merrick. Parallel ILU Preconditioning for Structured Grid Matrices.

Degree: MS, Computer Science and Engineering, 2015, The Ohio State University

 Many scientific simulation codes represent physical systems by storing dataat a set of discrete points. For example, a weather modeling software applicationmay store data representing… (more)

Subjects/Keywords: Computer Science; high-performance computing; numerical linear algebra; preconditioning; parallel programming; SIMD; vectorization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eisenlohr, J. M. (2015). Parallel ILU Preconditioning for Structured Grid Matrices. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1429820221

Chicago Manual of Style (16th Edition):

Eisenlohr, John Merrick. “Parallel ILU Preconditioning for Structured Grid Matrices.” 2015. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429820221.

MLA Handbook (7th Edition):

Eisenlohr, John Merrick. “Parallel ILU Preconditioning for Structured Grid Matrices.” 2015. Web. 15 Jan 2019.

Vancouver:

Eisenlohr JM. Parallel ILU Preconditioning for Structured Grid Matrices. [Internet] [Masters thesis]. The Ohio State University; 2015. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1429820221.

Council of Science Editors:

Eisenlohr JM. Parallel ILU Preconditioning for Structured Grid Matrices. [Masters Thesis]. The Ohio State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1429820221

24. Hartono, Albert. Tools for Performance Optimizations and Tuning of Affine Loop Nests.

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

  Multicore processors have become mainstream and the number of cores in a chip will continue to increase every year. Programming these architectures to effectively… (more)

Subjects/Keywords: Computer Science; compilers; loop optimizations; parametric tiling; loop parallelization; wavefront parallelism; empirical tuning; annotation-based optimizations

…Computer Science and Engineering Dept. The Ohio State University Columbus, Ohio Jun 2004–Sept… 

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):

Hartono, A. (2009). Tools for Performance Optimizations and Tuning of Affine Loop Nests. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1259685041

Chicago Manual of Style (16th Edition):

Hartono, Albert. “Tools for Performance Optimizations and Tuning of Affine Loop Nests.” 2009. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1259685041.

MLA Handbook (7th Edition):

Hartono, Albert. “Tools for Performance Optimizations and Tuning of Affine Loop Nests.” 2009. Web. 15 Jan 2019.

Vancouver:

Hartono A. Tools for Performance Optimizations and Tuning of Affine Loop Nests. [Internet] [Doctoral dissertation]. The Ohio State University; 2009. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259685041.

Council of Science Editors:

Hartono A. Tools for Performance Optimizations and Tuning of Affine Loop Nests. [Doctoral Dissertation]. The Ohio State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1259685041

25. Wiseman, Alec. GRT: Global R-Trees.

Degree: MS, Computer Science and Engineering, 2013, The Ohio State University

 As hardware technology advances, distributed architectures are becoming more and more complex. Writing software that fully and efficiently utilizes massively par- allel systems can be… (more)

Subjects/Keywords: Computer Science; R-Trees; Global Arrays; Spatial; Database; Parallel; Distributed

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wiseman, A. (2013). GRT: Global R-Trees. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1372420134

Chicago Manual of Style (16th Edition):

Wiseman, Alec. “GRT: Global R-Trees.” 2013. Masters Thesis, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1372420134.

MLA Handbook (7th Edition):

Wiseman, Alec. “GRT: Global R-Trees.” 2013. Web. 15 Jan 2019.

Vancouver:

Wiseman A. GRT: Global R-Trees. [Internet] [Masters thesis]. The Ohio State University; 2013. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1372420134.

Council of Science Editors:

Wiseman A. GRT: Global R-Trees. [Masters Thesis]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1372420134

26. Kettimuthu, Rajkumar. Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers.

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

 Data generated by experimental, simulation, and observational science is growing exponentially. The resulting datasets are often transported over wide-area networks for storage, analysis, or visualization.… (more)

Subjects/Keywords: Computer Science; Large Scale Data Transfer, File Transfer Scheduling, Modeling File Transfers, Differentiated Scheduling of File Transfers, Load Aware Scheduling Algorithm

…Information Science, The Ohio State University. July 1999 - August 2000… …Graduate Teaching Associate, The Ohio State University. March 2001 - June 2002… …Graduate Research Associate, The Ohio State University. June 2002 - December 2002… …Graduate Teaching Associate, The Ohio State University. April 2003 - April 2005… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kettimuthu, R. (2015). Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1437747493

Chicago Manual of Style (16th Edition):

Kettimuthu, Rajkumar. “Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers.” 2015. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1437747493.

MLA Handbook (7th Edition):

Kettimuthu, Rajkumar. “Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers.” 2015. Web. 15 Jan 2019.

Vancouver:

Kettimuthu R. Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers. [Internet] [Doctoral dissertation]. The Ohio State University; 2015. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1437747493.

Council of Science Editors:

Kettimuthu R. Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers. [Doctoral Dissertation]. The Ohio State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1437747493


The Ohio State University

27. Sabin, Gerald M. Unfairness in parallel job scheduling.

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

 Job scheduling has been an active area of research for many years. Most modern schedulers implement a form of space shared scheduling known as backfilling.… (more)

Subjects/Keywords: Computer Science; Parallel Job Scheduling; Backfilling; User Estimation; Moldability; Fairness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sabin, G. M. (2006). Unfairness in parallel job scheduling. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1164826017

Chicago Manual of Style (16th Edition):

Sabin, Gerald M. “Unfairness in parallel job scheduling.” 2006. Doctoral Dissertation, The Ohio State University. Accessed January 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1164826017.

MLA Handbook (7th Edition):

Sabin, Gerald M. “Unfairness in parallel job scheduling.” 2006. Web. 15 Jan 2019.

Vancouver:

Sabin GM. Unfairness in parallel job scheduling. [Internet] [Doctoral dissertation]. The Ohio State University; 2006. [cited 2019 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1164826017.

Council of Science Editors:

Sabin GM. Unfairness in parallel job scheduling. [Doctoral Dissertation]. The Ohio State University; 2006. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1164826017

.