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 “"Processor allocation"”.

  1. Processor allocation strategies for modified hypercubes

    … the number of communication ports for each processor grows as the logarithm of the total number of processors in the system. Therefore, once a hypercube supercomputer of a certain dimensionality has been built, any future expansions can be accomplished only by replacing the VLSI chips. This …

    njit Repository record for Processor allocation strategies for modified hypercubes (opens in a new tab)

  2. Processor allocation for partitionable multiprocessor systems

    The processor allocation problem in an n-dimensional hypercube multipro-cessor is similar to the conventional memory allocation problem. The main objective is to maximize the utilization of available resources as well as minimize the inherent system fragmentation. In this thesis, a new processor …

    njit Repository record for Processor allocation for partitionable multiprocessor systems (opens in a new tab)

  3. 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 …

    glasgow Download PDF for Efficient processor allocation strategies for mesh-connected multicomputers (opens in a new tab)

  4. Processor allocation and message broadcasting in hypercycle interconnection networks

    Hypercycles are a class of static multiprocessor interconnection networks with the ability of matching the processing node and communication link re­strictions of a large number of applications. This is in contras t with other popular interconnection topologies including hypercubes, k-ary n-cubes …

    uvic Repository record for Processor allocation and message broadcasting in hypercycle interconnection networks (opens in a new tab)

  5. Assessing Processor Allocation Strategies for Online List Scheduling of Moldable Task Graphs

    … each task can be executed by a varying number of processors with execution time depending on the processor allocation, represents a fundamental problem in high-performance computing (HPC). The online version of the scheduling problem introduces an additional constraint: each task is only …

    ku Repository record for Assessing Processor Allocation Strategies for Online List Scheduling of Moldable Task Graphs (opens in a new tab)

  6. Processor allocation, message scheduling, and algorithm selection for parallel space-time adaptive processing

    … the tasks and/or data of an application onto the processors so as to reduce the imposed inter-processor communication traffic. In addition to mapping the tasks and data to the processors in an efficient manner, it is also important to schedule the communication of messages during phases of data …

    ttu Repository record for Processor allocation, message scheduling, and algorithm selection for parallel space-time adaptive processing (opens in a new tab)

  7. Node to processor allocation for large grain data flow graphs in throughput-critical applications

    This thesis describes the issues involved in node allocation for a Large Grain Data Flow (LGDF) model used in Navy signal processing applications. In the model studied, nodes are assigned to processors based on load balancing, communication/computation overlap, and memory module contention. Current …

    nps Repository record for Node to processor allocation for large grain data flow graphs in throughput-critical applications (opens in a new tab)

  8. 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 …

    vt Repository record for Supporting Transparent Distributed Messaging for Dataflow Applications in Power Electronics Control Systems (opens in a new tab)

  9. 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 …

    uiuc Repository record for Resource Management for Distributed Memory Multicomputers (opens in a new tab)

  10. Processor allocator for chip multiprocessors

    Chip MultiProcessor (CMP) architectures consisting of many cores connected through Network-on-Chip (NoC) are becoming main computing platforms for research and computer centers, and in the future for commercial solutions. In order to effectively use CMPs, operating system is an important factor and …

    unlv Repository record for Processor allocator for chip multiprocessors (opens in a new tab) Download PDF for Processor allocator for chip multiprocessors (opens in a new tab)

  11. Interconnect-aware scheduling and resource allocation for high-level synthesis

    … into a structural description. The scheduling, processor allocation, and register binding are the most important tasks in the high-level synthesis. In the past, it has been possible to focus simply on the delays of the processing units in a high-level synthesis and neglect the wire delays, since …

    concordia Download PDF for Interconnect-aware scheduling and resource allocation for high-level synthesis (opens in a new tab)

  12. Design and performance evaluation of migration-based submesh allocation strategies in mesh multicomputers

    The problem of processor allocation on mesh-based multicomputer systems is considered in this thesis. Three efficient schemes are proposed to improve the performance of first-fit allocation strategies commonly used in practice. The first scheme, called the First-fit mesh bifurcation (FFMB) scheme, …

    nus Repository record for Design and performance evaluation of migration-based submesh allocation strategies in mesh multicomputers (opens in a new tab) Download file for Design and performance evaluation of migration-based submesh allocation strategies in mesh multicomputers (opens in a new tab)

  13. Scheduling real-time periodic tasks in multiprocessor systems

    … and soft real-time periodic tasks on multiple processor systems. We differentiate between hard and soft real-time jobs by using a quality of service (QoS) factor. The proposed models can be implemented on both shared and distributed memory systems. The scheduling process includes the decision …

    iastate Repository record for Scheduling real-time periodic tasks in multiprocessor systems (opens in a new tab)

  14. 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 …

    unlv Repository record for Task allocation and migration on a star-network (opens in a new tab) Download PDF for Task allocation and migration on a star-network (opens in a new tab)

  15. Geometric On-line Ray Searching Under Probability of Placement Scenarios

    … problems, namely the cow-path problem, the Processor-Allocation problem and the Robots-Search-Rays problem and highlight connections between them. Second, the main result is for the One-Robot-Searches-Two-Rays problem for which we consider the weighted scenario, in which the robot is located …

    waterloo Repository record for Geometric On-line Ray Searching Under Probability of Placement Scenarios (opens in a new tab)

  16. Performance assessment of mixed methods for time integration using an assembly-type queueing model

    … integration method can be affected by the allocation of the different methods to available processors and the selection of time-step sizes. Finding the combination of processor allocation and time-step mix that minimizes the computation time requires quantifying these effects. This thesis …

    manitoba Repository record for Performance assessment of mixed methods for time integration using an assembly-type queueing model (opens in a new tab)

  17. Hardware Implementation Of Processor Allocator For Mesh Connected Chip Multiprocessors

    … computing has led to the advent of Chip Multiprocessors (CMPs). CMP is the integration of two or more independent processor cores, which can read and execute program instructions, on to a single integrated circuit die. CMPs are the main computing platforms for research and development in …

    unlv Repository record for Hardware Implementation Of Processor Allocator For Mesh Connected Chip Multiprocessors (opens in a new tab) Download PDF for Hardware Implementation Of Processor Allocator For Mesh Connected Chip Multiprocessors (opens in a new tab)

  18. Space sharing job scheduling policies for parallel computers

    … that applications are allocated non-overlapping processor subsets. The interference among jobs is reduced, the synchronization delays and message latencies can be predictable, and distinct processors may be allocated to cooperating processes so as to avoid the overhead of context switches …

    iastate Repository record for Space sharing job scheduling policies for parallel computers (opens in a new tab)

  19. Large deviations analysis of scheduling policies for a web server

    … scheduling plays an important role in resource allocation (for instance, bandwidth allocation, processor allocation, etc). However, as the scale of a system increases so does the number of activities/events in the system (e.g., job arrivals), as a consequence of which the analysis of scheduling …

    texas Repository record for Large deviations analysis of scheduling policies for a web server (opens in a new tab)

Page 1 of 2