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 24 for “"Parallel and distributed systems"”.
-
Load balancing in parallel and distributed systems
… barriers prevent the widespread, common usage of parallel and distributed computing systems: (1) A language which expresses parallelism without reference to the underlying hardware configuration. (2) A user invisible method for effectively distributing the tasks that form the parallel/distributed …
-
Parallel asynchronous protocols on parallel and distributed systems
Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1997
-
Fault tolerant matrix operations for parallel and distributed systems
<p>With the proliferation of parallel and distributed systems, it is an increasingly important problem to render parallel applications fault-tolerant because such applications are more prone to failures with an increasing number of processors.</p> <p>This dissertation explores fault tolerance in a …
-
A novel simulator for heterogeneous parallel and distributed systems
In an era of complex networked heterogeneous systems, simulating independently only parts, components or attributes of a system-under-design is not a viable, accurate or efficient option. On top of that, the growing use of hardware accelerators in both embedded systems (e.g. mobile phones) and …
-
On contention management for data accesses in parallel and distributed systems
Data access is an essential part of any program, and is especially critical to the performance of parallel computing systems. The objective of this work is to investigate factors that affect data access parallelism in parallel computing systems, and design/evaluate methods to improve such …
-
Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems
Parallel and distributed systems are pervasive, such as web services, clouds, and cyber-physical systems. We often desire high throughput and small latency in the parallel and distributed system. However, since the system is distributed and the input is online, scheduling for high throughput while …
-
Checkpoint-based forward recovery using lookahead execution and rollback validation in parallel and distributed systems
… a forward recovery strategy using checkpointing and optimistic execution in parallel and distributed systems. The approach uses replicated tasks executing on different processors for forward recovery and checkpoint comparison for error detection. To reduce overall redundancy, this approach …
-
Design and Implementation of a Framework for the Interconnection of Cellular Automata in Software and Hardware
… has been a move recently in academia, industry, and the consumer space towards the use of unsupervised parallel computation and distributed networks (i.e., networks of computing elements working together to achieve a global outcome with only local knowledge). To fully understand the types of …
-
Large-Scale Spatial Data Management on Modern Parallel and Distributed Platforms
… cannot meet requirements of efficiency and scalability for large-scale spatial data processing. In this dissertation, we have developed new data-parallel designs for large-scale spatial data management that can better utilize modern inexpensive commodity parallel and distributed …
-
Οπτικοποίηση παράλληλων και κατανεμημένων συστημάτων: ολοκληρωμένο περιβάλλον προσομοίωσης παράλληλων και κατανεμημένων συστημάτων για την εφαρμογή μεθόδων οπτικοποίησης στη διδασκαλία του παράλληλου προγραμματισμού
The widespread use of parallel computer systems has lead to the development of new architectures, which support various programming models. As a consequence, there emerges the need for the establishment of research and educational standards and the training of students on the use and programming of …
-
View-centric Reasoning About Parallel and Distributed Computation
The development of distributed applications has not progressed as rapidly as its enabling technologies. In part, this is due to the difficulty of reasoning about such complex systems. In contrast to sequential systems, parallel systems give rise to parallel events, and the resulting uncertainty of …
-
Implementing concurrency in a process-based language
… another paradigm replacing it. But software systems are becoming ever more complex and hard to maintain. Adapting to new hardware will create further problems. The current combination of complex scope rules, inheritance, aspects, genericity, and multithreading cannot provide the flexibility …
-
Strategic Reactor Allocation for Deadlock-Free Execution
… of a single machine, we are turning towards parallel and distributed systems to extract additional performance by breaking down the problem into pieces and solving it simultaneously. While this provides a great opportunity for increased performance,e it comes with additional problems not …
-
Workflow Scheduling Algorithms in the Grid
The development of wide-area networks and the availability of powerful computers as low-cost commodity components are changing the face of computation. These progresses in technology make it possible to utilize geographically distributed resources in multiple owner domains to solve large-scale …
-
Fast Clustering Using a Grid-Based Underlying Density Function Approximation
… clustering, but many of them are overly complex and scale poorly with larger data sets. In this paper, a new algorithm for clustering is proposed to solve some of these issues. Density-based clustering algorithms use a concept called the “underlying density function”, which is a conceptual …
-
Self-stabilizing wormhole routing
Parallel and distributed systems are composed of individual processors that communicate with one another by exchanging messages through communication links. When the sender and the receiver of a message are not direct neighbors, intermediate processors must cooperate to ensure proper routing; …
-
Development and application of an efficient method for the solution of stochastic activity networks with deterministic activities
Modeling and evaluation of communication and computing systems is an important undertaking. In many cases, large-scale systems are designed in an ad-hoc manner, with validation (or disappointment regarding) system performance coming only after an implementation is made. This does not need to be the …
-
Algorithm Based Fault Tolerance: A Perspective from Algorithmic and Communication Characteristics of Parallel Algorithms
Checkpoint and recovery cost imposed by checkpoint/restart (CP/R) is a crucial performance issue for high-performance computing (HPC) applications. In comparison, Algorithm-Based Fault Tolerance (ABFT) is a promising fault tolerance method with low recovery overhead, but it suffers from the …
-
Algorithms for processing closest-pairs and nearest-neighbors queries on big spatial data in parallel and distributed frameworks
… to the position or geolocation of objects and elements on, below or above the earth’s surface. Such data, often termed geospatial data, appear in geography related applications. Currently, numerous applications and sources are creating explosive amounts of data with spatial characteristics …
Page 1 of 2