The single machine scheduling problem is considered in which each task has a release dates, a processing time and a due date. The objective is to mimimize the maximum lateness. Preemption is not allowed. Scheduling problem 1|rj |Lmax is a NP-hard problem. We define an IIT (inserted idle time) schedule as a feasible schedule in which a processor is kept idle at a time when it could begin process...

The power consumption of peripheral devices is a significant portion of the overall energy usage of a mobile platform. To take advantage of idle times, most devices offer the ability to transition into low power states. However, the amount of energy saved by utilizing these sleep states depends on the lengths and number of idle periods experienced by the device. This paper describes a new proce...

To solve the shortage defects of wireless spectrum source of Internet of things, an idle spectrum resources and immune sorting selection method based on the subjective and objective weight is proposed by using cognitive radio network technology. Firstly, the radio cognitive idle spectrum system is relied on to make the spectrum system modeling of Internet of things for the generation of objecti...

Energy efficient design for disk devices has become a very important issue, because ever increasing need for data storage systems significantly increases the power budget in the disk array. Most research on power management in disk devices focuses on the traditional way of stopping disk rotation. In this paper, we suggest a new approach in which the energy consumption can be reduced without sto...

Cellular digital packet data (CDPD) networks borrow idle radio channels from advanced mobile phone standard (AMPS) cellular networks to send packet data traffic. We explore the amount of unused AMPS capacity available to parasitic data networks such as CDPD. Due to trunking inefficiencies, a relatively large amount of spare AMPS airlink capacity can be found. In addition, the periods of time AM...

NetWork is an experiment in distributed computing. The idea is to make use of idle time on personal workstations while retaining their advantages of immediate and guarantied availability. NetWork wants to make use of otherwise idle resources only. The performance criterion of NetWork is the net work done per unit time not computing time or other measures of resource utilization. The NetWork mod...

The intake air control system of a gasoline engine is a typical nonlinear system, and included among the adverse factors that always induce poor idle-speed control stability are dead time and disturbances in the intake air control process. In this paper, to improve the responsiveness when idling with regard to disturbances, a mean-value engine model (MVEM) with dead time was constructed as the ...

The emergence of compute unified device architecture (CUDA), which has relieved application developers from having to understand complex graphics pipelines, has made the graphics processing unit (GPU) useful not only for graphics applications but also for general applications. In this paper, we present a cycle sharing system named GPU grid, which exploits idle GPU cycles to accelerate scientifi...

One challenging issue of sensor networks is extension of overall network system lifetimes. In periodic data gathering applications, the typical sensor node spends more time in the idle state than active state. Consequently, it is important to decrease power consumption during idle time. In this study, we propose a scheduling scheme based on the history of RTS/CTS exchange during the setup phase...

The process of patients’ routing from an Emergency Department (ED) to Internal Wards (IWs) is often a hospital’s bottleneck. Motivated by this process in Anonymous Hospital, we analyze queueing systems with heterogeneous server pools, where the pools represent the wards and servers are beds. Our queueing system, with a single centralized queue and several server pools, forms an inverted-V model...