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 6 of 6 for “"Processor allocation"”.
-
Efficient processor allocation strategies for mesh-connected multicomputers
Abstract Efficient processor allocation and job scheduling algorithms are critical if the full computational power of large-scale multicomputers is to be harnessed effectively. Processor allocation is responsible for selecting the set of processors on which parallel jobs are executed, whereas job …
-
Dynamic processor allocation for adaptively parallel work-stealing jobs
TCP's burstiness is usually regarded as harmful, or at best, inconvenient. Instead, this thesis suggests a new perspective and examines whether TCP's burstiness is useful for certain applications. It claims that burstiness can be harnessed to insulate traffic from packet reordering caused by route …
-
Supporting Transparent Distributed Messaging for Dataflow Applications in Power Electronics Control Systems
… protocol for distributed communication between processors. The processors are designed using dataflow architecture. The protocol ensures transparent asynchronous communication between distributed processes. The protocol is designed such that an application can run without change in virtually any …
-
Resource Management for Distributed Memory Multicomputers
… acyclic graphs, the LAST algorithm provides fast processor allocation and intelligent processor usage. For nondeterministic task graphs, the remap algorithm uses profiling data to iteratively improve the allocation decisions. The remap algorithm provides an efficient, distributed implementation …
-
Task allocation and migration on a star-network
… power which cannot be satisfied with uniprocessor systems. So the use of multiprocessor systems in such jobs becomes necessary. This thesis presents an approach of allocating the tasks to a multiprocessor system called the star network. Generally, an incoming task requires only a part of …
-
Data and Processor Mapping Strategies for Dynamically Resizable Parallel Applications
… can expand to take advantage of additional free processors, or to meet a Quality of Service (QoS) deadline, or can shrink to accommodate a high priority application, without getting suspended. This thesis is part of a larger effort to define a framework for dynamically resizable parallel …