Results 31 to 40 of about 337,018 (297)
The power of reordering for online minimum makespan scheduling [PDF]
, 2014 In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines.
Englert, Matthias +3 more
core +1 more source
Operating System Support for IPNoSys
CLEI Electronic Journal, 2012 The IPNoSys is an architecture that exploits the advantages of NoCs as parallel communication, reusability and scalability to transform the routers in processing elements building a packet-driven architecture that processing while routing the packets ...
Silvio Roberto Fernandes de Araújo +1 more
doaj +1 more source
Online Multi-Resource Social Welfare Maximization for Non-Preemptive Jobs
IEEE Access, 2020 Multi-resource allocation is ubiquitous in datacenters. Usually, the datacenter scheduler associates each user with a utility function and then allocates multiple resources so as to maximize the social welfare, which is the sum of the utilities of the ...
Chaoqun You, Cheng Ren, Lemin Li
doaj +1 more source
From Preemptive to Non-preemptive Scheduling Using Rejections [PDF]
, 2016 We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs
Lucarelli, Giorgio +2 more
openaire +2 more sources
IEEE Access, 2019 According to the prior research, a deterministic parallel test pattern generation (TPG) engine was realized and generated the same test pattern set the serial automatic test pattern generation does during acceleration.
Louis Y.-Z. Lin +2 more
doaj +1 more source
Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters [PDF]
, 2003 In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs' modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically.
Nudd, G. R. +9 more
core +1 more source
Novel Predictive Home Appliance's Management Algorithm in Smart Grids
Frontiers in Energy Research, 2020 Smart home appliances and applications are gaining popularity, due to the high level of service they provide to users. In a smart home, all electrical and smart appliances are interconnected together to form a special private network. Due to economic and
Wail Mardini +2 more
doaj +1 more source
The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System [PDF]
Journal of Optimization in Industrial Engineering, 2019 Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery ...
Javad Rezaeian +2 more
doaj +1 more source
Alternatives for modeling of preemptive scheduling [PDF]
Proceedings of the 19th conference on Winter simulation - WSC '87, 1987 A system which includes overt instances of preemptive scheduling, or which requires the use of preemptive scheduling to model the system, can pose difficulties to a modeler. By preemptive scheduling we mean having to reschedule or cancel a previously scheduled event (or activity completion).
openaire +2 more sources
IEEE AccessMixed-Criticality (MC) systems have to guarantee the timely execution of high-criticality tasks even under adversarial processor conditions. Prior work addresses preemptive scheduling, leaving the NP hard, non-preemptive scheduling problem unexplored ...
Muhammad ElMahdy +2 more
doaj +1 more source