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 184 for “"deadline"”.

  1. Reducing deadline miss rate for grid workloads running in virtual machines: a deadline-aware and adaptive approach

    … to increase their throughput by reducing job deadline miss rate. Integration of the virtualization into the grid to deploy on-demand virtual machines for jobs in a way that is transparent to the end users and have minimum impact on the existing system poses a significant challenge. This …

    greenwich Repository record for Reducing deadline miss rate for grid workloads running in virtual machines: a deadline-aware and adaptive approach (opens in a new tab)

  2. Transmission scheduling with deadline and throughput constraints

    … transmitting packets with hard delivery deadlines poses an important network control problem. In this thesis, we propose a framework for characterizing feasibility regions and finding an optimal scheduling policy in various wireless networks. First, we start with a wireless network with …

    mit Repository record for Transmission scheduling with deadline and throughput constraints (opens in a new tab)

  3. Performance guarantees for deadline-driven MapReduce jobs under failure

    Restriction data tranferred 2014-07-01T11:36:32-05:00 Original Data Group with Access Administrator Release Date: 2015-08-22 11:57:26 UTC Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system

    uiuc Repository record for Performance guarantees for deadline-driven MapReduce jobs under failure (opens in a new tab)

  4. Fundamental Impacts Of Delay And Deadline On Communications Over Wireless Networks

    Consumer demand for wireless networks has experienced an exponential increase in recent years, and such trend is expected to continue in the coming years. Therefore, there is a pressing need for more effective communication schemes to be able to cope with the explosive growth in the wireless …

    cornell Repository record for Fundamental Impacts Of Delay And Deadline On Communications Over Wireless Networks (opens in a new tab)

  5. Autonomous grid scheduling using probabilistic job runtime scheduling

    … on the concept of user requested job completion deadlines. In such a system, a user would be able to request each job to finish by a certain deadline, and possibly to a certain monetary cost. Implementing deadline scheduling is dependent on the ability to predict the execution time of each queued …

    ucl Repository record for Autonomous grid scheduling using probabilistic job runtime scheduling (opens in a new tab)

  6. Implicit And Explicit Racial Attitudes: Moderation Of Racial Typicality Evaluations

    … judgments three times without a response deadline, with a deadline equal to their median response during the no-deadline condition, and with a deadline equal to their 25th percentile response during the no-deadline condition. Skin color and facial physiognomy interacted to influence racial …

    wustl Repository record for Implicit And Explicit Racial Attitudes: Moderation Of Racial Typicality Evaluations (opens in a new tab)

  7. Scheduling Real-Time Computations With Temporal Distance and Separation Constraints and With Extended Deadlines

    … we mean that a computation's ready time or deadline is relative to the actual start time (or finishing time) of some other computation. The Job Scheduling with Distance Constraints problem requires certain pairs of jobs to be scheduled within some given distance of each other. The Job …

    uiuc Repository record for Scheduling Real-Time Computations With Temporal Distance and Separation Constraints and With Extended Deadlines (opens in a new tab)

  8. Schedulability analysis of resource access control protocols in real-time systems

    … scheduling algorithms, such as the earliest deadline first algorithm, are known to be effective and predictable in scheduling independent tasks. However, when concurrent tasks share resources in a mutually exclusive manner, the timing behavior of the system becomes less predictable. Due to …

    uiuc Repository record for Schedulability analysis of resource access control protocols in real-time systems (opens in a new tab)

  9. Dynamic rate-control and scheduling algorithms for quality-of-service in wireless networks

    … first, address energy-efficient transmission of deadline-constrained data over wire-less fading channels. In this setup, a transmitter with controllable transmission rate is considered, and the objective is to obtain a rate-control policy for transmitting deadline- constrained data with minimum …

    mit Repository record for Dynamic rate-control and scheduling algorithms for quality-of-service in wireless networks (opens in a new tab)

  10. Action and inaction in consumer and social contexts: the effects of prior and ongoing activity levels on intentions and decisions

    … perceived motivational fit with the immediate deadline, compared with prior inactive behaviors (e.g., standing, sitting) that invoke general inaction goals. As a result, prior active behaviors enhance the likelihood of initiating an action by an immediate deadline more than do prior inactive …

    uiuc Repository record for Action and inaction in consumer and social contexts: the effects of prior and ongoing activity levels on intentions and decisions (opens in a new tab)

  11. Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems

    … benefit and minimize aggregate missed deadline ratio. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute the allocation so that it is as "close" as possible to the optimal allocation. While RBA* analyzes process response times …

    vt Repository record for Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems (opens in a new tab)

  12. Fault Tolerance for Real-Time Systems: Analysis and Optimization of Roll-back Recovery with Checkpointing

    … while satisfying given time constraints (deadlines). Depending on the consequences when the deadlines are violated, RTSs are classified into soft and hard RTSs. While violating deadlines in soft RTSs usually results in some performance degradation, violating deadlines in hard RTSs results …

    lund Repository record for Fault Tolerance for Real-Time Systems: Analysis and Optimization of Roll-back Recovery with Checkpointing (opens in a new tab)

  13. Scheduling hard real-time jobs that allow imprecise results

    … desired quality cannot be produced before its deadline. This thesis discusses the problem of scheduling periodic jobs to meet deadlines on systems that support imprecise computations. In our workload models, each real-time task is logically decomposed into two parts: a mandatory part and an …

    uiuc Repository record for Scheduling hard real-time jobs that allow imprecise results (opens in a new tab)

  14. The Timing of Discrepant Interruptions and its Influence on Team Performance

    … project teams working on a creative task under a deadline engage in task transition during their allotted time (Gersick, 1988, 1989; Waller, Zellmer-Bruhn, & Giambatista, 2002). This dissertation focuses on the timing of the discrepant interruptions with regards to task transition. More …

    york Repository record for The Timing of Discrepant Interruptions and its Influence on Team Performance (opens in a new tab)

  15. HarmonySched: Dynamically scheduling multiple concurrent machine learning models across a heterogeneous system on chip

    … are ordered by first priority and then deadline. Unfinished GPU workloads are re-queued to allow for better resource sharing. Experiments show that this approach leads to a 2.7x reduction in tail latencies, 1.5x improvement in throughput, and 2.38x reduction in deadline violations …

    uiuc Repository record for HarmonySched: Dynamically scheduling multiple concurrent machine learning models across a heterogeneous system on chip (opens in a new tab)

  16. Application of deep learning for predicting schedules in real-time systems

    … in safety critical systems: a task missing a deadline can be catastrophic for the system and endanger human lives. To guarantee that it meets every deadline, hard real-time systems are designed to have deterministic behavior. However, such determinism is prone to timing inference attacks. …

    uiuc Repository record for Application of deep learning for predicting schedules in real-time systems (opens in a new tab)

  17. Thought and action: Event-related potentials and behaviour in a primed and speeded lexical decision task.

    … decisions in an Accuracy condition (response deadline 700 msec) and a Speed condition (deadline 450 msec). Targets were the prime's antonym, an unrelated word, or a nonword. The Speed condition reduced response time (RT) and accuracy, but not the latency of ERP deflections. RT varied with the …

    ottawa-retro Repository record for Thought and action: Event-related potentials and behaviour in a primed and speeded lexical decision task. (opens in a new tab)

  18. Bus scheduling implementation on the cell processor

    … to a “real-time constraint” - i.e., strict deadline guarantees. With uncontrollable cache and front side bus, in the modern computer architectures, the estimation of a tight bound, worst case execution time (WCET) is difficult. The new generation computer architecture, Cell Broadband Engine …

    uiuc Repository record for Bus scheduling implementation on the cell processor (opens in a new tab)

  19. Optical Flow Switching with time deadlines for high-performance applications

    … applications with very stringent time deadline constraints. In particular, we attempt to meet setup times only slightly longer than one roundtrip time with networks at moderate to high loading. In this work, we propose three possible scheduling mechanisms for OFS connection setup in a …

    mit Repository record for Optical Flow Switching with time deadlines for high-performance applications (opens in a new tab)

Page 1 of 10