A list scheduling approach is proposed in this paper to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the list scheduling algorithm in order to improve the test concurrency having assigned power dissipation limits. Moreover, the algorithm features a power dissipation balancing...

We present and analyze a general algorithm which computes an efficient static scheduling of block computations for a parallel L.D.L factorization of sparse symmetric positive definite systems based on a combination of 1D and 2D block distributions. Our solver uses a supernodal fan-in approach and is fully driven by this scheduling. We give an overview of the algorithm and present performance re...

Scheduling elective surgeries is a dynamic, sequential decision-making 1 process that must balance the costs of deferring waiting cases and blocking higher2 priority cases. Although other surgery scheduling problems have received extensive 3 treatment in the literature, this paper presents the first single-day scheduling problem 4 formulation to capture this aspect of the scheduling process whi...

UNLABELLED Determining the appropriate amount of block time to allocate to surgeons and selecting the days on which to schedule elective cases can maximize operating room (OR) use. We used computer simulation to model OR scheduling. Inputs in the computer model included different methods to determine when a patient will have surgery (on-line bin-packing algorithms), case durations, lengths of t...

This document describes the Camellia encryption algorithm. Camellia is a block cipher with 128-bit block size and 128-, 192-, and 256-bit keys. The algorithm description is presented together with key scheduling part and data randomizing part.