Anticipatory scheduling (AS) of I/O requests has become a viable choice for block-device schedulers in open-source OS-kernels as prior work has established its superiority over traditional disk-scheduling policies. An AS-scheduler selectively stalls the block-device right after servicing a request in hope that a new request for a nearby sector will be soon posted. Clearly, this decision may int...

The combination of multiuser multiple-input multiple-output (MU-MIMO) technology with orthogonal frequency division multiplexing (OFDM) is an attractive solution for next generation of wireless local area networks (WLANs), currently standardized within IEEE 802.11ac, and the fourth-generation (4G) mobile cellular wireless systems to achieve a very high system throughput while satisfying quality...

The job-shop scheduling (JSS) is a schedule planning for low volume systems with many variations in requirements. In job-shop scheduling problem (JSSP) environment, there are j jobs to be processed on m machines with a certain objective function to be minimized. JSSP with j jobs to be processed on more than two machines have been classified as a combinatorial problem. They cannot be formulated ...

In multiple-input multiple-output (MIMO) systems, the multiuser MIMO (MU-MIMO) systems have the potential to provide higher channel capacity owing to multiuser and spatial diversity. Block diagonalization (BD) is one of the techniques to realize MU-MIMO systems, where multiuser interference can be completely cancelled and therefore several users can be supported simultaneously. When the number ...

Lean principles and statistical analysis have been successfully implemented to hospitals and healthcare systems. These principles among other process improvement principles aim to detect and eliminate wastes in the system and its processes. In this paper, lean and statistical analysis were applied to systematically investigate the causes of low operating room (OR) block utilization and recommen...

Hierarchical block matching is an eecient motion estimation technique which provides an adaptation of the block size and the search area to the properties of the image. In this work, we propose two novel special-purpose architectures to implement hierarchical block matching for real-time applications. The rst architecture is memory-eecient, but requires a large external memory bandwidth and a l...

Few of the benefits of exploiting partially reconfigurable devices are power consumption reduction, cost reduction, and customized performance improvement. To obtain these benefits, one main problem needs to be solved is the task scheduling and placement. Existing algorithms tend to allocate tasks at positions where can block future tasks to be scheduled earlier denoted as ”blocking-effect”. To...

Recent forecasts in high-performance computing predict that programming models of the future will be asynchronous in nature. However, opportunistic execution of available work can lead to interference with segments of the computation that should execute synchronously. This paper describes a scheduling methodology that tightly synchronizes parts of an otherwise asynchronous parallel algorithm to...

We investigate the use of runtime measurements to improve job scheduling on a parallel machine. Emphasis is on gang scheduling based strategies. With the information gathered at runtime, we deene a task classiication scheme based on fuzzy logic and Bayesian estimators. The resulting local task classiication is used to provide better service to I/O bound and interactive jobs under gang schedulin...

This paper proposes a virtual harvest-transmit model and a harvest-transmit-store model for amplify-andforward full-duplex relay (FDR) networks with power splittingbased simultaneous wireless information and power transfer. The relay node employs a battery group consisting of two rechargeable batteries. By switching periodically between two batteries for charging and discharging in two consecut...