Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 231 for “"distributed computing"”.

  1. Lower bounds in distributed computing

    Distributed computing is the study of achieving cooperative behavior between independent computing processes with possibly conflicting goals. Distributed computing is ubiquitous in the Internet, wireless networks, multi-core and multi-processor computers, teams of mobile robots, etc. In this …

    mit Repository record for Lower bounds in distributed computing (opens in a new tab)

  2. Distributed computing with imperfect randomness

    … modeled appropriately, is "good enough" for distributed algorithms. Namely, can we do with imperfect randomness all that we can do with perfect randomness, and with comparable efficiency ? We answer this question in the affirmative, for the problem of Byzantine agreement. We construct …

    mit Repository record for Distributed computing with imperfect randomness (opens in a new tab)

  3. Embodied emergence : distributed computing manipulatives

    Distributed systems and the emergent properties that can arise out of simple localized interactions have fascinated scientists and artists alike for the last century. They challenge the notions of control and creativity, producing outcomes that can be beautiful, engaging and surprising at the same …

    mit Repository record for Embodied emergence : distributed computing manipulatives (opens in a new tab)

  4. Resource-Efficient and Robust Distributed Computing

    There has been a tremendous growth in the size of distributed systems in the past three decades. Today, distributed systems, such as the Internet, have become so large that they require highly scalable algorithms; algorithms that have asymptotically-small communication, computation, and latency …

    unm Repository record for Resource-Efficient and Robust Distributed Computing (opens in a new tab)

  5. Distributed Computing for Large-scale Graphs

    … theoretical and practical results in the area of distributed large- scale graph analysis by giving an overview of the entire pipeline. Data must first be pre-processed to obtain a graph, which is then partitioned into subgraphs of similar size. To analyze this graph the user must choose a system …

    trento Repository record for Distributed Computing for Large-scale Graphs (opens in a new tab)

  6. Distributed computing & solid oxide fuel cell modelling

    … improvements in small generators, enables the distributed generation paradigm to flourish. The objective of this work was two-fold; to develop a model to aid in the optimization of a tubular SOFC design, and to develop a distributed computing platform for the solution of large scale models on a …

    waikato-masters Repository record for Distributed computing & solid oxide fuel cell modelling (opens in a new tab)

  7. Resource Allocation for Wireless Distributed Computing Networks

    Wireless distributed computing networks (WDCNs) will become the next frontier of the wireless industry as the performance of wireless platforms is being increased every year and wireless industries are looking for "killer" applications for increased channel capacity. However, WDCNs have several …

    vt Repository record for Resource Allocation for Wireless Distributed Computing Networks (opens in a new tab)

  8. Adaptive Scheduling in Heterogeneous Distributed Computing Systems

    … area of adaptive scheduling for heterogeneous distributed systems. Given an unreliable, non-dedicated set of processing and communication resources, a scheduler is required to allocate tasks to processors. No information about the state of the system, which can vary over time, or the tasks to …

    maynooth Repository record for Adaptive Scheduling in Heterogeneous Distributed Computing Systems (opens in a new tab)

  9. Kami : an anarchic approach to distributed computing

    This thesis presents a distributed computing system, Kami, which provides support for applications running in an environment of heterogeneous workstations linked together by a high speed network. It enables users to easily create distributed applications by providing a backbone infrastructure of …

    mit Repository record for Kami : an anarchic approach to distributed computing (opens in a new tab)

  10. Randomness versus non-determinism in distributed computing

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.

    mit Repository record for Randomness versus non-determinism in distributed computing (opens in a new tab)

  11. Wireless Distributed Computing on the Android Platform

    … that run the Android operating system for distributed computing over a wireless mesh network is explored. This is also known as wireless distributed computing (WDC). The complexities of WDC on mobile devices are different from traditional distributed computing because of, among other …

    vt Repository record for Wireless Distributed Computing on the Android Platform (opens in a new tab)

  12. Wireless Distributed Computing in Cloud Computing Networks

    … functionalities can form a wireless cloud computing network (WCCN) and collaborate on executing complex applications using wireless distributed computing (WDC). Such a dynamically composed virtual cloud environment can offer services and resources hosted by individual nodes for consumption …

    vt Repository record for Wireless Distributed Computing in Cloud Computing Networks (opens in a new tab)

  13. Theory of Resource Allocation for Robust Distributed Computing

    Lately, distributed computing (DC) has emerged in several application scenarios such as grid computing, high-performance and reconfigurable computing, wireless sensor networks, battle management systems, peer-to-peer networks, and donation grids. When DC is performed in these scenarios, the …

    unm Repository record for Theory of Resource Allocation for Robust Distributed Computing (opens in a new tab)

  14. Algebraic approaches for coded caching and distributed computing

    … distribution and straggler mitigation within distributed computation.</p> <p>Caching is a popular technique for facilitating large scale content delivery over the Internet. Traditionally, caching operates by storing popular content closer to the end users. Recent work within the domain of …

    iastate Repository record for Algebraic approaches for coded caching and distributed computing (opens in a new tab)

  15. Modular specification of interaction policies in distributed computing

    Software executing on distributed systems consists of many asynchronous, autonomous components which interact in order to coordinate local activity. The need for such coordination, as well as requirements such as heterogeneity, scalability, security and availability, considerably increase the …

    uiuc Repository record for Modular specification of interaction policies in distributed computing (opens in a new tab)

  16. Memory consistency models for high performance distributed computing

    … the consistency guarantees of high performance distributed shared memory multiprocessors. This framework is based on computations, which specify the operations requested and constraints on how these operations may be applied; we call the framework computation-centric. This framework is …

    mit Repository record for Memory consistency models for high performance distributed computing (opens in a new tab)

  17. Distributed inference : combining variational inference with distributed computing

    … (Variational Message Passing) with a high-level distributed framework (Graphlab) and demonstrates that inference is performed faster on a few large graphical models when using this system.

    mit Repository record for Distributed inference : combining variational inference with distributed computing (opens in a new tab)

  18. Platforms for Teaching Distributed Computing Concepts to Undergraduate Students

    … information technology has been moving towards distributed computing to host their applications and services. These systems can process more data more reliably than their central processing counterparts; however, distributed applications are more complex to design and develop because they …

    calpoly Repository record for Platforms for Teaching Distributed Computing Concepts to Undergraduate Students (opens in a new tab)

  19. An Adaptive Resource Management Architecture for Global Distributed Computing

    … which by its very nature is open and distributed. We specify core resource management services---remote creation, distributed snapshot and directory services that can be used as a basis for more complex activities. The thesis develops mathematical frameworks and formal mechanisms for …

    uiuc Repository record for An Adaptive Resource Management Architecture for Global Distributed Computing (opens in a new tab)

Page 1 of 12