subject:(Distributed processing )

Rochester Institute of Technology

1. Chuang, Chien-Kuo. DIB on the Xerox workstation.

Degree: Computer Science (GCCIS), 1986, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/446

► DIB - A Distributed Implementation of Backtracking is a general-purpose package which allows applications that use tree-traversal algorithms such as backtrack and branch-and-bound to be… (more)

Subjects/Keywords: Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chuang, C. (1986). DIB on the Xerox workstation. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/446

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

Chicago Manual of Style (16^th Edition):

Chuang, Chien-Kuo. “DIB on the Xerox workstation.” 1986. Thesis, Rochester Institute of Technology. Accessed April 14, 2021. https://scholarworks.rit.edu/theses/446.

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

MLA Handbook (7^th Edition):

Chuang, Chien-Kuo. “DIB on the Xerox workstation.” 1986. Web. 14 Apr 2021.

Vancouver:

Chuang C. DIB on the Xerox workstation. [Internet] [Thesis]. Rochester Institute of Technology; 1986. [cited 2021 Apr 14]. Available from: https://scholarworks.rit.edu/theses/446.

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

Council of Science Editors:

Chuang C. DIB on the Xerox workstation. [Thesis]. Rochester Institute of Technology; 1986. Available from: https://scholarworks.rit.edu/theses/446

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

University of Illinois – Urbana-Champaign

2. Verma, Shiv. An experimental comparison of partitioning strategies in distributed graph processing.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97724

► In this thesis, we study the problem of choosing among partitioning strategies in distributed graph processing systems. To this end, we evaluate and characterize both… (more)

Subjects/Keywords: Distributed; Graph; Processing; Partitioning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Verma, S. (2017). An experimental comparison of partitioning strategies in distributed graph processing. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97724

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

Chicago Manual of Style (16^th Edition):

Verma, Shiv. “An experimental comparison of partitioning strategies in distributed graph processing.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 14, 2021. http://hdl.handle.net/2142/97724.

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

MLA Handbook (7^th Edition):

Verma, Shiv. “An experimental comparison of partitioning strategies in distributed graph processing.” 2017. Web. 14 Apr 2021.

Vancouver:

Verma S. An experimental comparison of partitioning strategies in distributed graph processing. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/2142/97724.

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

Council of Science Editors:

Verma S. An experimental comparison of partitioning strategies in distributed graph processing. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97724

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

Louisiana State University

3. Pokhrel, Ayam. Distributed Iterative Graph Processing Using NoSQL with Data Locality.

Degree: MS, Other Computer Engineering, 2018, Louisiana State University

URL: https://digitalcommons.lsu.edu/gradschool_theses/4710

► A tremendous amount of data is generated every day from a wide range of sources such as social networks, sensors, and application logs. Among… (more)

Subjects/Keywords: graph data processing; distributed computing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Pokhrel, A. (2018). Distributed Iterative Graph Processing Using NoSQL with Data Locality. (Masters Thesis). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_theses/4710

Chicago Manual of Style (16^th Edition):

Pokhrel, Ayam. “Distributed Iterative Graph Processing Using NoSQL with Data Locality.” 2018. Masters Thesis, Louisiana State University. Accessed April 14, 2021. https://digitalcommons.lsu.edu/gradschool_theses/4710.

MLA Handbook (7^th Edition):

Pokhrel, Ayam. “Distributed Iterative Graph Processing Using NoSQL with Data Locality.” 2018. Web. 14 Apr 2021.

Vancouver:

Pokhrel A. Distributed Iterative Graph Processing Using NoSQL with Data Locality. [Internet] [Masters thesis]. Louisiana State University; 2018. [cited 2021 Apr 14]. Available from: https://digitalcommons.lsu.edu/gradschool_theses/4710.

Council of Science Editors:

Pokhrel A. Distributed Iterative Graph Processing Using NoSQL with Data Locality. [Masters Thesis]. Louisiana State University; 2018. Available from: https://digitalcommons.lsu.edu/gradschool_theses/4710

University of Oklahoma

4. Grounds, Nicolas. Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing.

Degree: PhD, 2018, University of Oklahoma

URL: http://hdl.handle.net/11244/316298

► Scheduling tasks in a distributed system (e.g., cloud computing) in order to optimize an objective such as minimizing deadline misses has been a topic of… (more)

Subjects/Keywords: scheduling; distributed processing; robustness

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Grounds, N. (2018). Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/316298

Chicago Manual of Style (16^th Edition):

Grounds, Nicolas. “Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing.” 2018. Doctoral Dissertation, University of Oklahoma. Accessed April 14, 2021. http://hdl.handle.net/11244/316298.

MLA Handbook (7^th Edition):

Grounds, Nicolas. “Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing.” 2018. Web. 14 Apr 2021.

Vancouver:

Grounds N. Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing. [Internet] [Doctoral dissertation]. University of Oklahoma; 2018. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/11244/316298.

Council of Science Editors:

Grounds N. Feedback and Requirement Biasing for Enhancing Robustness of Scheduling Algorithms for Distributed System Processing. [Doctoral Dissertation]. University of Oklahoma; 2018. Available from: http://hdl.handle.net/11244/316298

Hong Kong University of Science and Technology

5. Gao, Xiang. Efficient parallel programming on datacenter platforms with disciplined memory access.

Degree: 2012, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/1/th_redirect.html

► Many distributed system technologies and programming frameworks are developed to support parallelized computation on the datacenter platform. While simplifying data-centric parallel computation, existing system technologies… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Database management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gao, X. (2012). Efficient parallel programming on datacenter platforms with disciplined memory access. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Gao, Xiang. “Efficient parallel programming on datacenter platforms with disciplined memory access.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Gao, Xiang. “Efficient parallel programming on datacenter platforms with disciplined memory access.” 2012. Web. 14 Apr 2021.

Vancouver:

Gao X. Efficient parallel programming on datacenter platforms with disciplined memory access. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/1/th_redirect.html.

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

Council of Science Editors:

Gao X. Efficient parallel programming on datacenter platforms with disciplined memory access. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/1/th_redirect.html

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

Rutgers University

6. Perry, Jason M. Putting secure computation to work.

Degree: PhD, Computer Science, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/48624/

►

The demand for solutions that enable secure computation in distributed systems is only increasing. However, the current state of secure computation "in the wild'' is… (more)

Subjects/Keywords: Computer security; Electronic data processing – Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Perry, J. M. (2015). Putting secure computation to work. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48624/

Chicago Manual of Style (16^th Edition):

Perry, Jason M. “Putting secure computation to work.” 2015. Doctoral Dissertation, Rutgers University. Accessed April 14, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/48624/.

MLA Handbook (7^th Edition):

Perry, Jason M. “Putting secure computation to work.” 2015. Web. 14 Apr 2021.

Vancouver:

Perry JM. Putting secure computation to work. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2021 Apr 14]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48624/.

Council of Science Editors:

Perry JM. Putting secure computation to work. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48624/

7. Nikou Sefat, Mohammad. A Theoretical Framework for Analysis of Communication Pathways.

Degree: MASc, Engineering - Software Systems, 2013, University of Regina

URL: http://hdl.handle.net/10294/5307

► Networks such as Peer-to-Peer (P2P), ad hoc, wireless sensor, and other complex networks do not support optimal communication between different devices across their configurations. They… (more)

Subjects/Keywords: Computer networks; Distributed algorithms; Computer algorithms; Electronic data processing – Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nikou Sefat, M. (2013). A Theoretical Framework for Analysis of Communication Pathways. (Masters Thesis). University of Regina. Retrieved from http://hdl.handle.net/10294/5307

Chicago Manual of Style (16^th Edition):

Nikou Sefat, Mohammad. “A Theoretical Framework for Analysis of Communication Pathways.” 2013. Masters Thesis, University of Regina. Accessed April 14, 2021. http://hdl.handle.net/10294/5307.

MLA Handbook (7^th Edition):

Nikou Sefat, Mohammad. “A Theoretical Framework for Analysis of Communication Pathways.” 2013. Web. 14 Apr 2021.

Vancouver:

Nikou Sefat M. A Theoretical Framework for Analysis of Communication Pathways. [Internet] [Masters thesis]. University of Regina; 2013. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10294/5307.

Council of Science Editors:

Nikou Sefat M. A Theoretical Framework for Analysis of Communication Pathways. [Masters Thesis]. University of Regina; 2013. Available from: http://hdl.handle.net/10294/5307

Hong Kong University of Science and Technology

8. Huang, Zengfeng. Computing summaries over distributed data.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html

► Consider a distributed system with k nodes, where each node holds a part of the data. The goal is to extract some useful information from… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Mathematical models ; Big data ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Huang, Z. (2013). Computing summaries over distributed data. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Huang, Zengfeng. “Computing summaries over distributed data.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Huang, Zengfeng. “Computing summaries over distributed data.” 2013. Web. 14 Apr 2021.

Vancouver:

Huang Z. Computing summaries over distributed data. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html.

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

Council of Science Editors:

Huang Z. Computing summaries over distributed data. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html

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

Hong Kong University of Science and Technology

9. Guo, Xiaonan. From localization to floor plan identification.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-80929 ; https://doi.org/10.14711/thesis-b1255209 ; http://repository.ust.hk/ir/bitstream/1783.1-80929/1/th_redirect.html

► With the rapid development in pervasive computing and Location-based Services (LBS), location information play an important role in various applications, such as tracking, surveillance, advertising… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Signal processing ; Localization theory ; Wireless localization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guo, X. (2013). From localization to floor plan identification. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-80929 ; https://doi.org/10.14711/thesis-b1255209 ; http://repository.ust.hk/ir/bitstream/1783.1-80929/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Guo, Xiaonan. “From localization to floor plan identification.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-80929 ; https://doi.org/10.14711/thesis-b1255209 ; http://repository.ust.hk/ir/bitstream/1783.1-80929/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Guo, Xiaonan. “From localization to floor plan identification.” 2013. Web. 14 Apr 2021.

Vancouver:

Guo X. From localization to floor plan identification. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-80929 ; https://doi.org/10.14711/thesis-b1255209 ; http://repository.ust.hk/ir/bitstream/1783.1-80929/1/th_redirect.html.

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

Council of Science Editors:

Guo X. From localization to floor plan identification. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-80929 ; https://doi.org/10.14711/thesis-b1255209 ; http://repository.ust.hk/ir/bitstream/1783.1-80929/1/th_redirect.html

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

Université Catholique de Louvain

10. Kalavri, Vasiliki. Performance optimization techniques and tools for distributed graph processing.

Degree: 2016, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/178915

► Distributed, shared-nothing architectures of commodity machines are a popular design choice for the implementation and deployment of big data platforms. The introduction of MapReduce, a… (more)

▼ Distributed, shared-nothing architectures of commodity machines are a popular design choice for the implementation and deployment of big data platforms. The introduction of MapReduce, a simple programming model for parallel data analysis, has greatly simplified data-parallel programming by abstracting the details of data partitioning, node communication, and fault tolerance. While MapReduce is a powerful model for simple tasks, such as text processing and web log analysis, it is a poor fit for more complex tasks, such as graph analysis. Inter-connected data that can be modeled as graphs appear in several application domains, including machine learning, recommendation, web search, and social network analysis. Graph algorithms are very diverse and expose various computation and communication patterns. MapReduce revolutionized the area of distributed data processing and inspired the development of similar high-level graph processing models and platforms. However, as graphs grow bigger, delivering high performance for graph analysis tasks becomes challenging. Existing distributed graph processing platforms often deliver disappointing performance, while demanding expensive resources, as compared to sequential or multi-threaded algorithms running on a single machine. Processing graphs on a single machine is often not a viable solution. First of all, graphs rarely appear as raw data. Instead, they are derived from processing, filtering, and transformation of other, often distributed, data sources. Second, graph analysis tasks are usually part of a larger data analysis pipeline. Thus, previous and succeeding processing might require distribution over several machines. Finally, the nature of the graph analysis problem might require distribution. Thus, developing optimization techniques and tools to improve the performance of distributed graph processing platforms is essential. In this thesis, we propose optimization techniques for distributed graph processing on general-purpose data processing engines and on specialized graph processors. Our optimizations leverage both data and algorithmic properties. Driven by a real-world graph problem, we design performance optimization techniques and tools. First, we describe a data processing pipeline that leverages an iterative graph algorithm for automatic classification of web trackers. Using this application as a motivating example, we examine how asymmetrical convergence of iterative graph algorithms can be used to reduce the amount of computation and communication in large-scale graph analysis. We propose an optimization framework for fixpoint algorithms and a declarative API for writing fixpoint applications. Our framework uses a cost model to automatically exploit asymmetrical convergence and evaluate execution strategies during runtime. We show that our cost model achieves speedup of up to 1.7x and communication savings of up to 54%. Next, we propose to use the concepts of semi-metricity and the metric backbone to reduce the amount of data that needs to be processed in… Advisors/Committee Members: UCL - SST/ICTM/INGI - Pôle en ingénierie informatique, UCL - Ecole Polytechnique de Louvain, Vlassov, Vladimir, Bonaventure , Olivier, Sadre, Ramin, Haridi, Seif, Nijssen, Siegfried, Van Roy, Peter.

Subjects/Keywords: Graph processing; Distributed systems; Big data

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kalavri, V. (2016). Performance optimization techniques and tools for distributed graph processing. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/178915

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

Chicago Manual of Style (16^th Edition):

Kalavri, Vasiliki. “Performance optimization techniques and tools for distributed graph processing.” 2016. Thesis, Université Catholique de Louvain. Accessed April 14, 2021. http://hdl.handle.net/2078.1/178915.

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

MLA Handbook (7^th Edition):

Kalavri, Vasiliki. “Performance optimization techniques and tools for distributed graph processing.” 2016. Web. 14 Apr 2021.

Vancouver:

Kalavri V. Performance optimization techniques and tools for distributed graph processing. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/2078.1/178915.

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

Council of Science Editors:

Kalavri V. Performance optimization techniques and tools for distributed graph processing. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/178915

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

Delft University of Technology

11. Zhang, H.M. (author). Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:932db0bb-da4c-4ffe-892a-036d01a8071b

►

The Primal-Dual Method of Multipliers (PDMM) is a new algorithm that solves convex optimization problems in a distributed manner. This study focuses on the convergence… (more)

Subjects/Keywords: convex optimization; distributed signal processing; ADMM; PDMM

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhang, H. M. (. (2015). Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:932db0bb-da4c-4ffe-892a-036d01a8071b

Chicago Manual of Style (16^th Edition):

Zhang, H M (author). “Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers.” 2015. Masters Thesis, Delft University of Technology. Accessed April 14, 2021. http://resolver.tudelft.nl/uuid:932db0bb-da4c-4ffe-892a-036d01a8071b.

MLA Handbook (7^th Edition):

Zhang, H M (author). “Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers.” 2015. Web. 14 Apr 2021.

Vancouver:

Zhang HM(. Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2021 Apr 14]. Available from: http://resolver.tudelft.nl/uuid:932db0bb-da4c-4ffe-892a-036d01a8071b.

Council of Science Editors:

Zhang HM(. Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:932db0bb-da4c-4ffe-892a-036d01a8071b

University of Georgia

12. Barnhard, David Howard. Distributed collaborative robotic mapping.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/22575

► The utilization of multiple robots to map an unknown environment is a challenging problem within Artificial Intelligence. This thesis first presents previous efforts to develop… (more)

Subjects/Keywords: Robotics; Artificial Intelligence; Distributed Processing; Collaborative Robotics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Barnhard, D. H. (2014). Distributed collaborative robotic mapping. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/22575

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

Chicago Manual of Style (16^th Edition):

Barnhard, David Howard. “Distributed collaborative robotic mapping.” 2014. Thesis, University of Georgia. Accessed April 14, 2021. http://hdl.handle.net/10724/22575.

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

MLA Handbook (7^th Edition):

Barnhard, David Howard. “Distributed collaborative robotic mapping.” 2014. Web. 14 Apr 2021.

Vancouver:

Barnhard DH. Distributed collaborative robotic mapping. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10724/22575.

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

Council of Science Editors:

Barnhard DH. Distributed collaborative robotic mapping. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/22575

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

Rochester Institute of Technology

13. Rodriguez, Wilfredo. Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance.

Degree: Computer Science (GCCIS), 1985, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/325

Not provided. Advisors/Committee Members: Heliotis, James.

Subjects/Keywords: Distributed computing systems; Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rodriguez, W. (1985). Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/325

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

Chicago Manual of Style (16^th Edition):

Rodriguez, Wilfredo. “Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance.” 1985. Thesis, Rochester Institute of Technology. Accessed April 14, 2021. https://scholarworks.rit.edu/theses/325.

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

MLA Handbook (7^th Edition):

Rodriguez, Wilfredo. “Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance.” 1985. Web. 14 Apr 2021.

Vancouver:

Rodriguez W. Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance. [Internet] [Thesis]. Rochester Institute of Technology; 1985. [cited 2021 Apr 14]. Available from: https://scholarworks.rit.edu/theses/325.

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

Council of Science Editors:

Rodriguez W. Identifying mechanisms (naming) in distributed systems: goals, implications and overall influence on performance. [Thesis]. Rochester Institute of Technology; 1985. Available from: https://scholarworks.rit.edu/theses/325

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

Rochester Institute of Technology

14. Rixner, Lois. A Survey and analysis of algorithms for the detection of termination in a distributed system.

Degree: Computer Science (GCCIS), 1991, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/442

► This paper looks at algorithms for the detection of termination in a distributed system and analyzes them for effectiveness and efficiency. A survey is done… (more)

Subjects/Keywords: Distributed systems; Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rixner, L. (1991). A Survey and analysis of algorithms for the detection of termination in a distributed system. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/442

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

Chicago Manual of Style (16^th Edition):

Rixner, Lois. “A Survey and analysis of algorithms for the detection of termination in a distributed system.” 1991. Thesis, Rochester Institute of Technology. Accessed April 14, 2021. https://scholarworks.rit.edu/theses/442.

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

MLA Handbook (7^th Edition):

Rixner, Lois. “A Survey and analysis of algorithms for the detection of termination in a distributed system.” 1991. Web. 14 Apr 2021.

Vancouver:

Rixner L. A Survey and analysis of algorithms for the detection of termination in a distributed system. [Internet] [Thesis]. Rochester Institute of Technology; 1991. [cited 2021 Apr 14]. Available from: https://scholarworks.rit.edu/theses/442.

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

Council of Science Editors:

Rixner L. A Survey and analysis of algorithms for the detection of termination in a distributed system. [Thesis]. Rochester Institute of Technology; 1991. Available from: https://scholarworks.rit.edu/theses/442

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

15. Balaji, Janani. Distributed Graph Storage And Querying System.

Degree: PhD, Computer Science, 2016, Georgia State University

URL: https://scholarworks.gsu.edu/cs_diss/110

► Graph databases offer an efficient way to store and access inter-connected data. However, to query large graphs that no longer fit in memory, it… (more)

▼ Graph databases offer an efficient way to store and access inter-connected data. However, to query large graphs that no longer fit in memory, it becomes necessary to make multiple trips to the storage device to filter and gather data based on the query. But I/O accesses are expensive operations and immensely slow down query response time and prevent us from fully exploiting the graph specific benefits that graph databases offer. The storage models of most existing graph database systems view graphs as indivisible structures and hence do not allow a hierarchical layering of the graph. This adversely affects query performance for large graphs as there is no way to filter the graph on a higher level without actually accessing the entire information from the disk. Distributing the storage and processing is one way to extract better performance. But current distributed solutions to this problem are not entirely effective, again due to the indivisible representation of graphs adopted in the storage format. This causes unnecessary latency due to increased inter-processor communication. In this dissertation, we propose an optimized distributed graph storage system for scalable and faster querying of big graph data. We start with our unique physical storage model, in which the graph is decomposed into three different levels of abstraction, each with a different storage hierarchy. We use a hybrid storage model to store the most critical component and restrict the I/O trips to only when absolutely necessary. This lets us actively make use of multi-level filters while querying, without the need of comprehensive indexes. Our results show that our system outperforms established graph databases for several class of queries. We show that this separation also eases the difficulties in distributing graph data and go on propose a more efficient distributed model for querying general purpose graph data using the Spark framework. Advisors/Committee Members: Dr. Rajshekhar Sunderraman, Dr. Yingshu Li, Dr. Yanqing Zhang, Dr. Hendricus Van der Holst.

Subjects/Keywords: Graph Databases; Distributed Graph Databases; Distributed Graph Query Processing; Spark

12 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Balaji, J. (2016). Distributed Graph Storage And Querying System. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/110

Chicago Manual of Style (16^th Edition):

Balaji, Janani. “Distributed Graph Storage And Querying System.” 2016. Doctoral Dissertation, Georgia State University. Accessed April 14, 2021. https://scholarworks.gsu.edu/cs_diss/110.

MLA Handbook (7^th Edition):

Balaji, Janani. “Distributed Graph Storage And Querying System.” 2016. Web. 14 Apr 2021.

Vancouver:

Balaji J. Distributed Graph Storage And Querying System. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2021 Apr 14]. Available from: https://scholarworks.gsu.edu/cs_diss/110.

Council of Science Editors:

Balaji J. Distributed Graph Storage And Querying System. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/cs_diss/110

Hong Kong University of Science and Technology

16. Wu, Junfeng. Event-based state estimation : theory and applications.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

► This thesis focuses on remote state estimation problem where an estimator uses data sent by a sensor to estimate the state of a linear discrete-time… (more)

Subjects/Keywords: Event processing (Computer science) ; Electronic data processing ; Distributed processing ; Sensor networks ; Data processing ; Estimation theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wu, J. (2013). Event-based state estimation : theory and applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Wu, Junfeng. “Event-based state estimation : theory and applications.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Wu, Junfeng. “Event-based state estimation : theory and applications.” 2013. Web. 14 Apr 2021.

Vancouver:

Wu J. Event-based state estimation : theory and applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html.

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

Council of Science Editors:

Wu J. Event-based state estimation : theory and applications. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

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

Ryerson University

17. Feyzmohammadi, Leila. Application Of Residue Codes For Error Detection In Mixed Signal Devices.

Degree: 2013, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1683

► Testing methods based on residue codes are considered as simple, with high probability of detecting errors. Most of the literatures on arithmetic error control codes… (more)

Subjects/Keywords: Electronic data processing – Distributed processing; Electric fault location

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Feyzmohammadi, L. (2013). Application Of Residue Codes For Error Detection In Mixed Signal Devices. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1683

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

Chicago Manual of Style (16^th Edition):

Feyzmohammadi, Leila. “Application Of Residue Codes For Error Detection In Mixed Signal Devices.” 2013. Thesis, Ryerson University. Accessed April 14, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A1683.

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

MLA Handbook (7^th Edition):

Feyzmohammadi, Leila. “Application Of Residue Codes For Error Detection In Mixed Signal Devices.” 2013. Web. 14 Apr 2021.

Vancouver:

Feyzmohammadi L. Application Of Residue Codes For Error Detection In Mixed Signal Devices. [Internet] [Thesis]. Ryerson University; 2013. [cited 2021 Apr 14]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1683.

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

Council of Science Editors:

Feyzmohammadi L. Application Of Residue Codes For Error Detection In Mixed Signal Devices. [Thesis]. Ryerson University; 2013. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1683

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

University of Alberta

18. Isloor, Sreekaanth S. Consistency aspects of distributed databases.

Degree: PhD, Department of Computing Science, 1979, University of Alberta

URL: https://era.library.ualberta.ca/files/mp48sf73p

"August 1979."

Subjects/Keywords: Electronic data processing – Distributed processing.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Isloor, S. S. (1979). Consistency aspects of distributed databases. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/mp48sf73p

Chicago Manual of Style (16^th Edition):

Isloor, Sreekaanth S. “Consistency aspects of distributed databases.” 1979. Doctoral Dissertation, University of Alberta. Accessed April 14, 2021. https://era.library.ualberta.ca/files/mp48sf73p.

MLA Handbook (7^th Edition):

Isloor, Sreekaanth S. “Consistency aspects of distributed databases.” 1979. Web. 14 Apr 2021.

Vancouver:

Isloor SS. Consistency aspects of distributed databases. [Internet] [Doctoral dissertation]. University of Alberta; 1979. [cited 2021 Apr 14]. Available from: https://era.library.ualberta.ca/files/mp48sf73p.

Council of Science Editors:

Isloor SS. Consistency aspects of distributed databases. [Doctoral Dissertation]. University of Alberta; 1979. Available from: https://era.library.ualberta.ca/files/mp48sf73p

University of Alberta

19. McDonell, Ken J. A unified approach to secondary storage input-output operations.

Degree: Department of Computing Science, 1977, University of Alberta

URL: https://era.library.ualberta.ca/files/dv13zw901

Subjects/Keywords: Electronic data processing – Distributed processing.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

McDonell, K. J. (1977). A unified approach to secondary storage input-output operations. (Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/dv13zw901

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

Chicago Manual of Style (16^th Edition):

McDonell, Ken J. “A unified approach to secondary storage input-output operations.” 1977. Thesis, University of Alberta. Accessed April 14, 2021. https://era.library.ualberta.ca/files/dv13zw901.

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

MLA Handbook (7^th Edition):

McDonell, Ken J. “A unified approach to secondary storage input-output operations.” 1977. Web. 14 Apr 2021.

Vancouver:

McDonell KJ. A unified approach to secondary storage input-output operations. [Internet] [Thesis]. University of Alberta; 1977. [cited 2021 Apr 14]. Available from: https://era.library.ualberta.ca/files/dv13zw901.

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

Council of Science Editors:

McDonell KJ. A unified approach to secondary storage input-output operations. [Thesis]. University of Alberta; 1977. Available from: https://era.library.ualberta.ca/files/dv13zw901

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

Nelson Mandela Metropolitan University

20. Thomas, Godwin Dogara Ayenajeh. A virtual-community-centric model for coordination in the South African public sector.

Degree: DPhil, Faculty of Engineering, the Built Environment and Information Technology, 2014, Nelson Mandela Metropolitan University

URL: http://hdl.handle.net/10948/d1021073

► Organizations face challenges constantly owing to limited resources. As such, to take advantage of new opportunities and to mitigate possible risks they look for new… (more)

▼ Organizations face challenges constantly owing to limited resources. As such, to take advantage of new opportunities and to mitigate possible risks they look for new ways to collaborate, by sharing knowledge and competencies. Coordination among partners is critical in order to achieve success. The segmented South African public sector is no different. Driven by the desire to ensure proper service delivery in this sector, various government bodies and service providers play different roles towards the attainment of common goals. This is easier said than done, given the complexity of the distributed nature of the environment. Heterogeneity, autonomy, and the increasing need to collaborate provoke the need to develop an integrative and dynamic coordination support service system in the SA public sector. Thus, the research looks to theories/concepts and existing coordination practices to ground the process of development. To inform the design of the proposed artefact the research employs an interdisciplinary approach championed by coordination theory to review coordination-related theories and concepts. The effort accounts for coordination constructs that characterize and transform the problem and solution spaces. Thus, requirements are explicit towards identifying coordination breakdowns and their resolution. Furthermore, how coordination in a distributed environment is supported in practice is considered from a socio-technical perspective in an effort to account holistically for coordination support. Examining existing solutions identified shortcomings that, if addressed, can help to improve the solutions for coordination, which are often rigidly and narrowly defined. The research argues that introducing a mediating technological artefact conceived from a virtual community and service lenses can serve as a solution to the problem. By adopting a design-science research paradigm, the research develops a model as a primary artefact to support coordination from a collaboration standpoint. The suggestions from theory and practice and the unique case requirement identified through a novel case analysis framework form the basis of the model design. The proposed model support operation calls for an architecture which employs a design pattern that divides a complex whole into smaller, simpler parts, with the aim of reducing the system complexity. Four fundamental functions of the supporting architecture are introduced and discussed as they would support the operation and activities of the proposed collaboration lifecycle model geared towards streamlining coordination in a distributed environment. As part of the model development knowledge contributions are made in several ways. Firstly, an analytical instrument is presented that can be used by an enterprise architect or business analyst to study the coordination status quo of a collaborative activity in a distributed environment. Secondly, a lifecycle model is presented as meta-process model with activities that are geared towards streamlining the coordination of dynamic… Advisors/Committee Members: Botha, Reinhardt A Prof, Van Greunen, Darelle Prof.

Subjects/Keywords: Electronic data processing – Distributed processing; Interprofessional relations; Virtual work teams

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Thomas, G. D. A. (2014). A virtual-community-centric model for coordination in the South African public sector. (Doctoral Dissertation). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/d1021073

Chicago Manual of Style (16^th Edition):

Thomas, Godwin Dogara Ayenajeh. “A virtual-community-centric model for coordination in the South African public sector.” 2014. Doctoral Dissertation, Nelson Mandela Metropolitan University. Accessed April 14, 2021. http://hdl.handle.net/10948/d1021073.

MLA Handbook (7^th Edition):

Thomas, Godwin Dogara Ayenajeh. “A virtual-community-centric model for coordination in the South African public sector.” 2014. Web. 14 Apr 2021.

Vancouver:

Thomas GDA. A virtual-community-centric model for coordination in the South African public sector. [Internet] [Doctoral dissertation]. Nelson Mandela Metropolitan University; 2014. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10948/d1021073.

Council of Science Editors:

Thomas GDA. A virtual-community-centric model for coordination in the South African public sector. [Doctoral Dissertation]. Nelson Mandela Metropolitan University; 2014. Available from: http://hdl.handle.net/10948/d1021073

Oregon State University

21. King, Jonathan B. Optimization of machine allocation in RingLeader.

Degree: MS, Computer Science, 1996, Oregon State University

URL: http://hdl.handle.net/1957/34077

► Many different types of distributed batch scheduling systems have been developed in the last decade to take advantage of the decentralization of computers and the… (more)

Subjects/Keywords: Electronic data processing – Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

King, J. B. (1996). Optimization of machine allocation in RingLeader. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/34077

Chicago Manual of Style (16^th Edition):

King, Jonathan B. “Optimization of machine allocation in RingLeader.” 1996. Masters Thesis, Oregon State University. Accessed April 14, 2021. http://hdl.handle.net/1957/34077.

MLA Handbook (7^th Edition):

King, Jonathan B. “Optimization of machine allocation in RingLeader.” 1996. Web. 14 Apr 2021.

Vancouver:

King JB. Optimization of machine allocation in RingLeader. [Internet] [Masters thesis]. Oregon State University; 1996. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/1957/34077.

Council of Science Editors:

King JB. Optimization of machine allocation in RingLeader. [Masters Thesis]. Oregon State University; 1996. Available from: http://hdl.handle.net/1957/34077

Colorado State University

22. Ericson, Kathleen. Robust health stream processing.

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

URL: http://hdl.handle.net/10217/88427

► As the cost of personal health sensors decrease along with improvements in battery life and connectivity, it becomes more feasible to allow patients to leave… (more)

Subjects/Keywords: interference detection; health stream processing; stream processing; distributed systems; fault-tolerance

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ericson, K. (2014). Robust health stream processing. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/88427

Chicago Manual of Style (16^th Edition):

Ericson, Kathleen. “Robust health stream processing.” 2014. Doctoral Dissertation, Colorado State University. Accessed April 14, 2021. http://hdl.handle.net/10217/88427.

MLA Handbook (7^th Edition):

Ericson, Kathleen. “Robust health stream processing.” 2014. Web. 14 Apr 2021.

Vancouver:

Ericson K. Robust health stream processing. [Internet] [Doctoral dissertation]. Colorado State University; 2014. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10217/88427.

Council of Science Editors:

Ericson K. Robust health stream processing. [Doctoral Dissertation]. Colorado State University; 2014. Available from: http://hdl.handle.net/10217/88427

Colorado State University

23. Suriarachchi, Amila. Achieving high-throughput distributed, graph-based multi-stage stream processing.

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

URL: http://hdl.handle.net/10217/170271

► Processing complex computations on high volume streaming data in real time is a challenge for many organizational data processing systems. Such systems should produce results… (more)

Subjects/Keywords: complex event processing; distributed event stream processing; performance

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Suriarachchi, A. (2015). Achieving high-throughput distributed, graph-based multi-stage stream processing. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/170271

Chicago Manual of Style (16^th Edition):

Suriarachchi, Amila. “Achieving high-throughput distributed, graph-based multi-stage stream processing.” 2015. Masters Thesis, Colorado State University. Accessed April 14, 2021. http://hdl.handle.net/10217/170271.

MLA Handbook (7^th Edition):

Suriarachchi, Amila. “Achieving high-throughput distributed, graph-based multi-stage stream processing.” 2015. Web. 14 Apr 2021.

Vancouver:

Suriarachchi A. Achieving high-throughput distributed, graph-based multi-stage stream processing. [Internet] [Masters thesis]. Colorado State University; 2015. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10217/170271.

Council of Science Editors:

Suriarachchi A. Achieving high-throughput distributed, graph-based multi-stage stream processing. [Masters Thesis]. Colorado State University; 2015. Available from: http://hdl.handle.net/10217/170271

Hong Kong University of Science and Technology

24. Dai, Chuming IELM. Randomized transaction broadcasting mechanism for bitcoin.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-102282 ; https://doi.org/10.14711/thesis-991012763467503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102282/1/th_redirect.html

► Most cryptocurrencies are based on blockchain. For example, in Bitcoin, all miners work together to create a sequence of blocks, each of which contains a… (more)

Subjects/Keywords: Bitcoin ; Transaction systems (Computer systems) ; Electronic data processing ; Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dai, C. I. (2019). Randomized transaction broadcasting mechanism for bitcoin. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102282 ; https://doi.org/10.14711/thesis-991012763467503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102282/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Dai, Chuming IELM. “Randomized transaction broadcasting mechanism for bitcoin.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-102282 ; https://doi.org/10.14711/thesis-991012763467503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102282/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Dai, Chuming IELM. “Randomized transaction broadcasting mechanism for bitcoin.” 2019. Web. 14 Apr 2021.

Vancouver:

Dai CI. Randomized transaction broadcasting mechanism for bitcoin. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-102282 ; https://doi.org/10.14711/thesis-991012763467503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102282/1/th_redirect.html.

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

Council of Science Editors:

Dai CI. Randomized transaction broadcasting mechanism for bitcoin. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102282 ; https://doi.org/10.14711/thesis-991012763467503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102282/1/th_redirect.html

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

KTH

25. Carbone, Paris. Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms.

Degree: SCS, 2013, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171358

► Recent advances in reliable distributed computing have made it possible to provide high availability and scalability to traditional systems and thus serve them as… (more)

Subjects/Keywords: distributed systems; computer systems; stream processing; complex event processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Carbone, P. (2013). Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171358

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

Chicago Manual of Style (16^th Edition):

Carbone, Paris. “Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms.” 2013. Thesis, KTH. Accessed April 14, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171358.

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

MLA Handbook (7^th Edition):

Carbone, Paris. “Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms.” 2013. Web. 14 Apr 2021.

Vancouver:

Carbone P. Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms. [Internet] [Thesis]. KTH; 2013. [cited 2021 Apr 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171358.

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

Council of Science Editors:

Carbone P. Fault Tolerant Distributed Complex Event Processing on Stream Computing Platforms. [Thesis]. KTH; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171358

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

Hong Kong University of Science and Technology

26. Liu, Peng. Improving the quality of shared-memory concurrent programs.

Degree: 2014, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

► Shared-memory concurrent programs are pervasive in this multi-core era. In these programs, programmers use the threads to concurrently access the shared data and use the… (more)

▼ Shared-memory concurrent programs are pervasive in this multi-core era. In these programs, programmers use the threads to concurrently access the shared data and use the locks to synchronize between the threads to guarantee the data integrity or the correctness. Specifying the synchronization that achieves both the high performance and the correctness is very challenging. For example, programmers may specify the overly restrictively synchronization, which often leads to the performance bottleneck because it unnecessarily prevents multiple threads from concurrently accessing the shared data. On the other hand, programmers may specify the inadequate synchronization, which leads to concurrency bugs such as data races, atomicity violations and deadlocks. This thesis makes two main contributions. The first contribution is the proposal of two bug fixing techniques Axis and Grail. The manual fixing of the concurrency bugs is challenging and error-prone, e.g., 39% of the manual fixes are incorrect, because the programmers need to reason about the huge space of possible thread interleavings. Existing approaches have been proposed to automatically fix the atomicity violations, one important category of concurrency bugs. They either do not provide the correctness, e.g., new bugs may be introduced, or greatly sacrifice the concurrency, due to the imprecise reasoning. ⋅ Axis is the first automatic atomicity violation fixing technique that guarantees the correctness and besides, it allows more concurrency than existing approaches. The correctness guarantee and the precise reasoning of the concurrency is enabled by the use of the well-studied discrete control theory. Under the hood, Axis reduces the problem of violation fixing to a constraint solving problem and implements the solver based on the control theory. Our evaluation on 13 subjects shows that our patches commonly outperform that of existing approaches. With the deadlock-free guarantee, our patches incur moderate overhead (around 10%), which is a worthwhile cost for correctness. ⋅ Grail is a general fixing algorithm that departs from previous techniques (including Axis) by simultaneously providing both the correctness and the optimal performance guarantees. Grail synthesizes bug-free yet fully optimal synchronization. To achieve this, Grail builds a model of the buggy code that is both contextual, distinguishing among different runtime configurations to ensure efficiency, and global, accounting for the entire synchronization behavior of the involved threads to ensure correctness. Evaluation of Grail on 12 real-world bugs from popular codebases confirms its practical advantages, especially compared with existing techniques: The Grail patches are mostly 40% more efficient, and incur only 2% overhead. The second contribution is the proposal of the fixing of performance bottlenecks caused by the overly restrictive synchronization. Our proposed approach automatically fine tunes the existing overly restrictive synchronization to unleash more concurrency for the accesses of the…

Subjects/Keywords: Parallel programming (Computer science) ; Electronic data processing ; Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Liu, P. (2014). Improving the quality of shared-memory concurrent programs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Liu, Peng. “Improving the quality of shared-memory concurrent programs.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Liu, Peng. “Improving the quality of shared-memory concurrent programs.” 2014. Web. 14 Apr 2021.

Vancouver:

Liu P. Improving the quality of shared-memory concurrent programs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html.

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

Council of Science Editors:

Liu P. Improving the quality of shared-memory concurrent programs. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

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

Hong Kong University of Science and Technology

27. Cui, Ying. Delay-aware resource control in wireless communication systems.

Degree: 2011, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7613 ; https://doi.org/10.14711/thesis-b1160594 ; http://repository.ust.hk/ir/bitstream/1783.1-7613/1/th_redirect.html

► Efficient resource management is one of the key components in the design of wireless communication systems. There is plenty of literature on cross-layer resource control… (more)

▼ Efficient resource management is one of the key components in the design of wireless communication systems. There is plenty of literature on cross-layer resource control to improve physical layer performance, such as throughput, signal to interference and noise ratio (SINR) and bit error rate (BER), etc. The derived resource control polices are adaptive to the channel state information (CSI) only. A typical assumption in these papers is that the transmitters have infinite backlogs and the information flows are delay-insensitive. In practice, a lot of applications in wireless communications systems are delay-sensitive. Therefore, it is also very important to consider random bursty arrivals and delay performance in resource control. This thesis takes a cross-layer approach to address delay-optimal resource control problems to minimize average delay for delay-sensitive applications in wireless communication systems. The derived resource control polices are adaptive to both the CSI and the queue state information (QSI). We consider the delay-optimal resource control design and delay performance analysis for tandem networks under different link connectivity conditions. We borrow the calculus approach and use queueing theory as well as dynamic programming in continuous-time optimal control to obtain the delay-optimal and asymptotical optimal resource control designs. Using renewal theory, theory of random walks and sample path analysis, we analyze the delay performance of the delay-optimal design and the delay penalty of the throughput-optimal dynamic backpressure (DBP) policy compared with the delay-optimal policy. We consider the delay-optimal resource control designs in single-cell orthogonal frequency-division multiple access (OFDMA) systems and cooperative and coordinated multiple-input and multiple-output (MIMO) systems in cellular networks. We formulate the corresponding delay-optimal resource control problems as infinite horizon average cost per stage Markov decision processes (MDPs). To obtain low complexity and distributed delay-aware resource control designs, we carefully approximate the potential functions and Q-factors using approximate MDP and estimate them using distributed stochastic learning. We show the proposed low complexity distributed algorithms converge almost surely. In addition, we also analyze the asymptotic delay performance of the proposed solution or compare the delay performance of the proposed solution with the corresponding base policies.

Subjects/Keywords: Wireless communication systems ; Electronic data processing – Distributed processing ; Electronic traffic controls

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cui, Y. (2011). Delay-aware resource control in wireless communication systems. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7613 ; https://doi.org/10.14711/thesis-b1160594 ; http://repository.ust.hk/ir/bitstream/1783.1-7613/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Cui, Ying. “Delay-aware resource control in wireless communication systems.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-7613 ; https://doi.org/10.14711/thesis-b1160594 ; http://repository.ust.hk/ir/bitstream/1783.1-7613/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Cui, Ying. “Delay-aware resource control in wireless communication systems.” 2011. Web. 14 Apr 2021.

Vancouver:

Cui Y. Delay-aware resource control in wireless communication systems. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-7613 ; https://doi.org/10.14711/thesis-b1160594 ; http://repository.ust.hk/ir/bitstream/1783.1-7613/1/th_redirect.html.

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

Council of Science Editors:

Cui Y. Delay-aware resource control in wireless communication systems. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7613 ; https://doi.org/10.14711/thesis-b1160594 ; http://repository.ust.hk/ir/bitstream/1783.1-7613/1/th_redirect.html

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

Hong Kong University of Science and Technology

28. Luo, Wuman. Efficient algorithms for frequent path finding and similarity join in big multidimensional data.

Degree: 2012, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7889 ; https://doi.org/10.14711/thesis-b1213376 ; http://repository.ust.hk/ir/bitstream/1783.1-7889/1/th_redirect.html

► The arrival of cyber-physical system era is changing data analysis in many ways. Driven by the advances in Internet and sensor techniques, the amount of… (more)

▼ The arrival of cyber-physical system era is changing data analysis in many ways. Driven by the advances in Internet and sensor techniques, the amount of multidimensional contents, such as images, trajectories, video clips, etc., has grown to an unprecedented level. Supporting multidimensional objects in large scale requires signiﬁcant extensions from traditional databases. One critical issue is indexing and query processing. In this thesis, we discuss two important queries in massive multidimensional datasets: frequent path ﬁnding and high-dimensional similarity join. In the context of big data, these two queries are challenging due to two reasons: 1) they both contain expensive comparison operations, and 2) the complex structures of their interested data complicate the index design. To address these issues, we conduct theoretical analysis, advanced algorithm design, as well as extensive experiments on large-scale datasets. First, we address the problem of frequent path ﬁnding by proposing a new query named the time period-based most frequent path (TPMFP). Speciﬁcally, given a time period T, a source s, and a destination d, TPMFP query searches the most frequent path (MFP) from s to d during T. Though there exists several proposals on deﬁning MFP, they only consider a ﬁxed time period. Most importantly, we ﬁnd that none of them can well reﬂect people’s common sense notion which can be described by three key properties, namely suﬃx-optimal (i.e., any suﬃx of an MFP is also an MFP), length-insensitive (i.e., MFP should not favor shorter or longer paths), and bottleneck-free (i.e., MFP should not contain infrequent edges). The TPMFP with the above properties will reveal not only common routing preferences of the past travelers, but also take the time eﬀectiveness into consideration. Therefore, our ﬁrst task is to give an TPMFP deﬁnition which satisﬁes the above three properties. Then, given the comprehensive TPMFP deﬁnition, our next task is to ﬁnd TPMFP over huge amount of trajectory data eﬃciently. Particularly, we propose eﬃcient search algorithms together with novel indexes to speed up the processing of TPMFP. Second, we study how to perform parallel high-dimensional similarity joins (HDSJs) in MapReduce eﬃciently in the MapReduce paradigm. Particularly, we propose a cost model to demonstrate that it is important to take both communication cost and computation cost into account as dimensionality and data volume increases. To this end, we propose dimension aggregation approximation (DAA), an eﬃcient compression approach that can help signiﬁcantly reduce both these costs when performing parallel HDSJs. Moreover, we design DAA-based parallel HDSJ algorithms which can scale up to massive data sizes and very high dimensionality. Finally, we conduct comprehensive experiments using real large-scale datasets. The number of trajectories for path ﬁnding is up to 10 million and the average trajectory length (in terms of the number of vertices) is 21. The number of image vectors for join is up to 1 million and the…

Subjects/Keywords: Electronic data processing ; Distributed processing ; Computer algorithms ; Multidimensional databases

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Luo, W. (2012). Efficient algorithms for frequent path finding and similarity join in big multidimensional data. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7889 ; https://doi.org/10.14711/thesis-b1213376 ; http://repository.ust.hk/ir/bitstream/1783.1-7889/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Luo, Wuman. “Efficient algorithms for frequent path finding and similarity join in big multidimensional data.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-7889 ; https://doi.org/10.14711/thesis-b1213376 ; http://repository.ust.hk/ir/bitstream/1783.1-7889/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Luo, Wuman. “Efficient algorithms for frequent path finding and similarity join in big multidimensional data.” 2012. Web. 14 Apr 2021.

Vancouver:

Luo W. Efficient algorithms for frequent path finding and similarity join in big multidimensional data. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-7889 ; https://doi.org/10.14711/thesis-b1213376 ; http://repository.ust.hk/ir/bitstream/1783.1-7889/1/th_redirect.html.

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

Council of Science Editors:

Luo W. Efficient algorithms for frequent path finding and similarity join in big multidimensional data. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7889 ; https://doi.org/10.14711/thesis-b1213376 ; http://repository.ust.hk/ir/bitstream/1783.1-7889/1/th_redirect.html

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

Hong Kong University of Science and Technology

29. Wang, Min. Resource management and optimization in content oriented networks.

Degree: 2015, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-78834 ; https://doi.org/10.14711/thesis-b1514599 ; http://repository.ust.hk/ir/bitstream/1783.1-78834/1/th_redirect.html

► Today, the Internet is increasingly becoming a platform for online services and massive content distribution. However, it was originally designed to primarily support pairwise host-to-host… (more)

▼ Today, the Internet is increasingly becoming a platform for online services and massive content distribution. However, it was originally designed to primarily support pairwise host-to-host communications and thus is poorly suited for content dissemination among multiple hosts. With voluminous video content becoming the dominant traffic, such host-centric paradigm is increasingly revealing its inefficiencies. In recent years, we have seen a variety of attempts to provide more efficient content delivery support on the Internet, including i) research efforts of content-centric networking (CCN) as a clean-slate redesign of the Internet architecture; ii) the wide adoption of CDN services; and iii) the fast expansion of cloud infrastructures offering vital support for modern data-intensive applications. We coin “content-oriented networking” to mean all these networks and services that make the Internet become a better platform for content distribution. In this thesis, we address several important practical problems on resource management and optimization in such content-oriented networks. This thesis consists of three parts. The ﬁrst part is about content management in CCN. CCN adopts pervasive in-network caching. But the default ubiquitous-LRU caching scheme leads to serious on-path redundancy. We begin with proposing a new caching scheme PCP and demonstrate via trace-driven simulations that it outperforms ubiquitous-LRU in both microscopic and macroscopic views. PCP and many other newly proposed caching schemes in the literature focus on reducing on-path cache redundancy, which relies on either explicit or implicit cooperation between nodes along the request-response path. This approach inherently suffers from the scalability issue and the hurdle of requiring uniform policy enforcement across different autonomous systems (ASes). To overcome these limitations, we next propose an intra-AS cache cooperation scheme iCCS, which commits to eliminating both on-path and off-path cache redundancy within a speciﬁc AS via periodic cooperative redundancy eliminations. Through trace-based simulations on multiple realistic network topologies, we show that iCCS signiﬁcantly shortens the request-response latency, and dramatically reduces the amount of transit traffc without increasing internal link congestions. After that, we study the content peering problem in CCN by proposing an optimization model CPP. With extensive numerical experiments under realistic AS-level peering graphs, we ﬁnd that the interconnectivity of the peering graph greatly inﬂuences the maximum potential peering beneﬁt, and that cooperative caching could yield higher peering beneﬁt than local greedy caching but is sensitive to various parameters. The second part is dedicated to content multi-homing with multiple CDNs. We propose the MCDN-CM model, aiming to make an optimal operating plan for an authoritative CDN by deciding how to supply content requests with guaranteed QoE. We show via numerical experiments under realistic settings that MCDN-CM achieves a…

Subjects/Keywords: Electronic data processing ; Distributed processing ; Mathematical models ; Database management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, M. (2015). Resource management and optimization in content oriented networks. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-78834 ; https://doi.org/10.14711/thesis-b1514599 ; http://repository.ust.hk/ir/bitstream/1783.1-78834/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Wang, Min. “Resource management and optimization in content oriented networks.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-78834 ; https://doi.org/10.14711/thesis-b1514599 ; http://repository.ust.hk/ir/bitstream/1783.1-78834/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Wang, Min. “Resource management and optimization in content oriented networks.” 2015. Web. 14 Apr 2021.

Vancouver:

Wang M. Resource management and optimization in content oriented networks. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-78834 ; https://doi.org/10.14711/thesis-b1514599 ; http://repository.ust.hk/ir/bitstream/1783.1-78834/1/th_redirect.html.

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

Council of Science Editors:

Wang M. Resource management and optimization in content oriented networks. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: http://repository.ust.hk/ir/Record/1783.1-78834 ; https://doi.org/10.14711/thesis-b1514599 ; http://repository.ust.hk/ir/bitstream/1783.1-78834/1/th_redirect.html

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

Hong Kong University of Science and Technology

30. Li, Wei. Storage optimization for large wide tables in Hadoop.

Degree: 2015, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/1/th_redirect.html

► Recent advances in data warehousing technologies are enabling the storage and processing of extremely large data sets. In viewing this opportunity, the leading cross-bank settlement… (more)

Subjects/Keywords: Apache Hadoop ; Big data ; Data warehousing ; Electronic data processing ; Distributed processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Li, W. (2015). Storage optimization for large wide tables in Hadoop. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/1/th_redirect.html

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

Chicago Manual of Style (16^th Edition):

Li, Wei. “Storage optimization for large wide tables in Hadoop.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed April 14, 2021. http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/1/th_redirect.html.

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

MLA Handbook (7^th Edition):

Li, Wei. “Storage optimization for large wide tables in Hadoop.” 2015. Web. 14 Apr 2021.

Vancouver:

Li W. Storage optimization for large wide tables in Hadoop. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2021 Apr 14]. Available from: http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/1/th_redirect.html.

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

Council of Science Editors:

Li W. Storage optimization for large wide tables in Hadoop. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/1/th_redirect.html

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

Open Access Theses and Dissertations