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 19 of 19 for “"Parallel jobs"”.

  1. Scheduling Multiple Parallel Jobs Online

    The prevalence of parallel processing has only increased in recent years. Today, most computing machines available on the market shifted from using single processors to possessing a multicore architecture. Naturally, there has been considerable work in developing parallel programming languages and …

    wustl Repository record for Scheduling Multiple Parallel Jobs Online (opens in a new tab)

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

    wustl Repository record for Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems (opens in a new tab)

  3. An Empirical Evaluation of Multi-Resource Scheduling for Moldable Workflows

    … of computational workflows comprised of moldable parallel jobs. Moldable parallel jobs allow the scheduler to select the resource allocations at launch time and thus can adapt to the available system resources (as compared to rigid jobs) while staying easy to design and implement (as compared to …

    ku Repository record for An Empirical Evaluation of Multi-Resource Scheduling for Moldable Workflows (opens in a new tab)

  4. Quality of service based data-aware scheduling

    … shared distributed supercomputers running large parallel jobs and introduce a ``data-aware'' scheduling paradigm that overcomes these challenges by making use of Quality of Service classes for running applications on shared resources. We evaluate the new data-aware scheduling paradigm using an …

    lsu-thes Repository record for Quality of service based data-aware scheduling (opens in a new tab)

  5. Dynamic resource management in heterogeneous systems: maximizing utility, value, and energy-efficiency

    … In this research, HPC systems executing parallel jobs are considered with and without energy constraints. Additionally, the case where preemption is available is considered for HPC systems executing only serial jobs. Dynamic resource management techniques are designed, evaluated, and …

    colostate Repository record for Dynamic resource management in heterogeneous systems: maximizing utility, value, and energy-efficiency (opens in a new tab)

  6. Multiprocessor Scheduling of Mixed-Criticality Parallel Systems

    … mixed-criticality tasks and ignored intra-task parallelism. As MC systems are increasingly being implemented on multiprocessor platforms, it is important to take advantage of intra-task parallelism in order to accommodate tasks with higher execution demands and tighter deadlines, such as those …

    nebraska Repository record for Multiprocessor Scheduling of Mixed-Criticality Parallel Systems (opens in a new tab)

  7. Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems

    … a related scheduling problem. Here we are given parallel jobs instead of rectangles that have to be executed in $N$ platforms of processors. Such a job can be identified with a rectangle, but in contrast to rectangle packing in parallel job scheduling we are allowed to cut the jobs into vertical …

    cau-kiel Repository record for Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems (opens in a new tab)

  8. Practical Time Travel of Multiprocessor Systems

    … platforms, there is a growing pressure to make parallel programming the norm. Unfortunately, most current programmers find parallel programming too complex. Therefore, we need tools, models, and architectures that make multiprocessors more programmable. One compelling way to improve …

    uiuc Repository record for Practical Time Travel of Multiprocessor Systems (opens in a new tab)

  9. Optimal Scheduling for Asymmetric Multi-core Server Processors

    The arrival rate of jobs at servers in a data-center can vary significantly over time. The servers in data-centers are typically multi-core processors, which allow jobs to be processed at different degrees of parallelism (DoPs), i.e., the number of threads spawned by a job. In this thesis, we show …

    waterloo Repository record for Optimal Scheduling for Asymmetric Multi-core Server Processors (opens in a new tab)

  10. Flexible Computing with Virtual Machines

    … executing in cloud environments, such as parallel jobs or clustered servers, to swiftly grow and shrink their footprint according to execution demands. This thesis shows how we can use system virtualization to implement systems that provide scale and location flexibility. To that effect we …

    toronto-retro Repository record for Flexible Computing with Virtual Machines (opens in a new tab)

  11. Combinatorial Auction-Based Virtual Machine Provisioning And Allocation In Clouds

    … auction-based mechanisms to execute parallel jobs the cloud. We outline our contribution and possible direction for future research in this field.

    wayne-thes Repository record for Combinatorial Auction-Based Virtual Machine Provisioning And Allocation In Clouds (opens in a new tab)

  12. Text mining with neural network and MapReduce

    … network in MapReduce framework which used for parallel programming. This approach has advantage when program works with growing unstructured data on distributed file storage system. The results show that natural language processing method improves classification performance. When this program …

    missouri Repository record for Text mining with neural network and MapReduce (opens in a new tab)

  13. Processor allocator for chip multiprocessors

    … support a multiuser environment in which many parallel jobs are executed simultaneously. It is done by the processor management system of the operating system, which consists of two components: Job Scheduler (JS) and Processor Allocator (PA). The JS is responsible for job scheduling that deals …

    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)

  14. PARALLEL COMPUTING WITH P2P DESKTOP GRIDS

    Tightly-coupled parallel computing is an important tool for problem solving. Structured peer-to-peer network overlays are failure-tolerant and have a low admin- istrative burden. This work seeks to unite the two. First, I present a completely decentralized algorithm for parallel job scheduling and …

    maryland Repository record for PARALLEL COMPUTING WITH P2P DESKTOP GRIDS (opens in a new tab)

  15. Techniques for efficient high performance computing in the cloud

    … load balancing for HPC applications, and parallel runtime for enabling dynamically shrinking or expanding parallel jobs, significantly improve HPC performance and cloud resource utilization for HPC in cloud. We believe that our research will help users gain confidence in the capabilities …

    uiuc Repository record for Techniques for efficient high performance computing in the cloud (opens in a new tab)

  16. Parallel Real-Time Scheduling for Latency-Critical Applications

    … problem of scheduling multiple latency-critical jobs on a multiprocessor or multicore machine has been extensively studied for sequential (non-parallizable) jobs and different system models and different objectives have been considered. However, the computational requirement of a single job is …

    wustl Repository record for Parallel Real-Time Scheduling for Latency-Critical Applications (opens in a new tab)

  17. Coping with the State Explosion Problem in Formal Methods: Advanced Abstraction Techniques and Big Data Approaches.

    … such analysis techniques, and studying ways to parallelize the algorithms in order to exploit multi-core and distributed architectures. Since cloud-based computing resources have became easily accessible, there is an opportunity for verification techniques and tools to undergo a deep …

    milano Repository record for Coping with the State Explosion Problem in Formal Methods: Advanced Abstraction Techniques and Big Data Approaches. (opens in a new tab)

  18. Αποτίμηση της απόδοσης πολιτικών χρονοδρομολόγησης παράλληλων εργασιών σε συστήματα πλέγματος με μοντέλα προσομοίωσης

    … of this thesis is the performance evaluation of parallel job scheduling policies in grid systems by means of simulation models. The workload characteristics are responsible for the performance of the system. Therefore, the system must implement the necessary algorithms and techniques that will …

    greece Repository record for Αποτίμηση της απόδοσης πολιτικών χρονοδρομολόγησης παράλληλων εργασιών σε συστήματα πλέγματος με μοντέλα προσομοίωσης (opens in a new tab)

  19. Efficient processor allocation strategies for mesh-connected multicomputers

    … for selecting the set of processors on which parallel jobs are executed, whereas job scheduling is responsible for determining the order in which the jobs are executed. Many processor allocation strategies have been devised for mesh-connected multicomputers and these can be divided into two …

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