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 architec-tures for implementing hierarchical block matching. The rst architecture is memory-eecient, but requires a large external memory bandwidth and a large number of process...

Yong Li , Arne Svensson and Sorour Falahati Communication Systems Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Göteborg, Sweden, Tel.: +46 31 772 1767, Fax: +46 31 772 1748, Email:fFrank.Li, Arne.Svensson, [email protected] Abstract | The performance of packet data transmission where several blocks are combined together into a physical lay...

S elective procedures in an operating suite is a formidable task because of competing performance metrics and uncertain surgery durations. In this paper, we present an optimization framework for batch scheduling within a block booking system that maximizes the expected utilization of operating room resources subject to a set of probabilistic capacity constraints. The algorithm iteratively solve...

In 1980 Miyazaki considered the weight of a job in which weight shows the relative priority over some other job in a sequencing of different jobs. After that some researchers such as Ghanshiam Das, Singh and Singhal [1981], Panwalker [1991] Sotskov, Allahverdi and Lai [2000], Chandramouli (2005) and Belwal, Mittal (2008) had considered the idea of N-job 2 machine flow shop scheduling problem wi...

The cipher CTC (Courtois Toy Cipher) described in [4] has been designed to demonstrate that it is possible to break on a PC a block cipher with good diffusion and very small number of known (or chosen) plaintexts. It has however never been designed to withstand all known attacks on block ciphers and Dunkelman and Keller have shown [13] that a few bits of the key can be recovered by Linear Crypt...

Round addition differential fault analysis using operation skipping for lightweight block ciphers with on-the-fly key scheduling is presented. For 64-bit KLEIN, it is shown that only a pair of correct and faulty ciphertexts can be used to derive the secret master key. For PRESENT, one correct ciphertext and two faulty ciphertexts are required to reconstruct the secret key. Furthermore, secret k...

In this report, we illustrate the lookahead transformation in both the dependence graph and the signal ow graph domains. Various scheduling approaches for ne-grain pipelined adaptive QR algorithm are proposed, including pipelining, block processing, and incremental block processing. Among them, the incremental block processing ooers the least amount of hardware complexity which is linear increa...

The performance of a Video-on-Demand broadcasting scheme is commonly evaluated by the maximum waiting time encountered by the customer before viewing can start. This paper addresses the issue of minimizing the average waiting time. Recently, we proposed Harmonic Block Windows scheduling to specifically minimize the average waiting time for given bandwidth. Here, we present an efficient heuristi...

A Task Graph (TG) is a model of a parallel program that consists of many subtasks that can be executed simultaneously on different processing elements. Subtasks exchange data via an interconnection network. The dependencies between subtasks are described by means of a Directed Acyclic Graph. Unfortunately, due to their characteristics, scheduling a TG requires dedicated or uninterruptible resou...

Several allocation policies proposed in the literature for hypercubes provide only in-cremental performance improvement at the cost of complexity. This is primarily due to the FCFS scheduling used for job sequencing. Larger jobs tend to block the succeeding jobs which could otherwise be allocated on the system. A greater impact on the performance can be obtained by eecient job scheduling. This ...