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:"University of Texas – Austin" +contributor:("Chidambaram, Vijay"). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. -2588-8379. PebblesDB : building key-value stores using fragmented log-structured merge trees.

Degree: MSin Computer Sciences, Computer Science, 2018, University of Texas – Austin

 Key-value stores such as LevelDB and RocksDB offer excellent write throughput, but suffer high write amplification. The write amplification problem is due to the Log-Structured… (more)

Subjects/Keywords: PebblesDB; Key-value stores; Log-structured merge trees; FLSM; Write-optimized data structures; Fragmented Log-Structured Merge Trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-2588-8379. (2018). PebblesDB : building key-value stores using fragmented log-structured merge trees. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68212

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-2588-8379. “PebblesDB : building key-value stores using fragmented log-structured merge trees.” 2018. Masters Thesis, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/68212.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-2588-8379. “PebblesDB : building key-value stores using fragmented log-structured merge trees.” 2018. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-2588-8379. PebblesDB : building key-value stores using fragmented log-structured merge trees. [Internet] [Masters thesis]. University of Texas – Austin; 2018. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/68212.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-2588-8379. PebblesDB : building key-value stores using fragmented log-structured merge trees. [Masters Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68212

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Texas – Austin

2. -5889-417X. Studying and improving POSIX asynchronous IO implemented in GLIBC.

Degree: MSin Computer Sciences, Computer Science, 2018, University of Texas – Austin

 Asynchronous IO (AIO) is considered a good way to hide the IO latency since we can move to other computation when waiting for the IO… (more)

Subjects/Keywords: IO; Asynchronous IO; POSIX; GLIBC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-5889-417X. (2018). Studying and improving POSIX asynchronous IO implemented in GLIBC. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/64120

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-5889-417X. “Studying and improving POSIX asynchronous IO implemented in GLIBC.” 2018. Masters Thesis, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/64120.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-5889-417X. “Studying and improving POSIX asynchronous IO implemented in GLIBC.” 2018. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-5889-417X. Studying and improving POSIX asynchronous IO implemented in GLIBC. [Internet] [Masters thesis]. University of Texas – Austin; 2018. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/64120.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-5889-417X. Studying and improving POSIX asynchronous IO implemented in GLIBC. [Masters Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/64120

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Texas – Austin

3. -8376-588X. TAI : threaded asynchronous I/O library for performance and portability.

Degree: MSin Computer Sciences, Computer Science, 2018, University of Texas – Austin

 In this paper, we investigate the behavior and performance of disk I/O using different types of libraries. We analyze the scenario where we can benefit… (more)

Subjects/Keywords: Asynchronous I/O; C++17; Lock-free queue; Benchmark

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-8376-588X. (2018). TAI : threaded asynchronous I/O library for performance and portability. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/64119

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-8376-588X. “TAI : threaded asynchronous I/O library for performance and portability.” 2018. Masters Thesis, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/64119.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-8376-588X. “TAI : threaded asynchronous I/O library for performance and portability.” 2018. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-8376-588X. TAI : threaded asynchronous I/O library for performance and portability. [Internet] [Masters thesis]. University of Texas – Austin; 2018. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/64119.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-8376-588X. TAI : threaded asynchronous I/O library for performance and portability. [Masters Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/64119

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

4. -2178-1988. Program analysis techniques for algorithmic complexity and relational properties.

Degree: PhD, Computer Science, 2019, University of Texas – Austin

 Analyzing standard safety properties of a given program has traditionally been the primary focus of the program analysis community. Unfortunately, there are still many interesting… (more)

Subjects/Keywords: Complexity testing; Optimal program synthesis; Fuzzing; Genetic programming; Performance bug; Vulnerability detection; Side channel; Static analysis; Relational verification; Reinforcement learning; Policy gradient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-2178-1988. (2019). Program analysis techniques for algorithmic complexity and relational properties. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Jan 24]. Available from: http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

5. Tripathi, Aastha. Analysis of storage bottlenecks in Deep Learning models.

Degree: MSin Computer Sciences, Computer Science, 2019, University of Texas – Austin

 Deep Learning (DL) is gaining prominence and is widely used for a plethora of problems. DL models, however, take in the order of days to… (more)

Subjects/Keywords: Deep neural networks; CPU; GPU utilization; Storage bottlenecks; Maximum batch size

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tripathi, A. (2019). Analysis of storage bottlenecks in Deep Learning models. (Masters Thesis). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5468

Chicago Manual of Style (16th Edition):

Tripathi, Aastha. “Analysis of storage bottlenecks in Deep Learning models.” 2019. Masters Thesis, University of Texas – Austin. Accessed January 24, 2021. http://dx.doi.org/10.26153/tsw/5468.

MLA Handbook (7th Edition):

Tripathi, Aastha. “Analysis of storage bottlenecks in Deep Learning models.” 2019. Web. 24 Jan 2021.

Vancouver:

Tripathi A. Analysis of storage bottlenecks in Deep Learning models. [Internet] [Masters thesis]. University of Texas – Austin; 2019. [cited 2021 Jan 24]. Available from: http://dx.doi.org/10.26153/tsw/5468.

Council of Science Editors:

Tripathi A. Analysis of storage bottlenecks in Deep Learning models. [Masters Thesis]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5468

.