An algorithm for arranging response surface designs in small blocks

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Multistratum response surface designs

Response surface designs are usually described as if the treatments have been completely randomized to the experimental units. However, in practice there is often a structure to the units, implying the need for blocking. If, in addition, some factors are more difficult to vary between units than others, a multistratum structure arises naturally. We present a general strategy for constructing response surface designs in multistratum unit structures. Designs are constructed stratum by stratum, starting in the highest stratum. In each stratum a prespecified treatment set for the factors applied in that stratum is arranged to be nearly orthogonal to the units in the higher strata, allowing-for all the effects that have to be estimated. Three examples are given to show the applicability of the method and are also used to check the relationship of the final design to the choice of treatment set. Finally, some practical considerations in randomization are discussed.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.