Timestamp representations for virtual sequences

The problem of executing sequential programs optimistically using the Time Warp algorithm is considered. It is shown how to do this, by first mapping the sequential execution to a control tree and then assigning timestamps to each node in the tree. For such timestamps to be effective they must be finite, this implies that they must be periodically rescaled to allow old timestamps to be reused. A number of timestamp representations are described and compared on the basis of: their complexity; the frequency and cost of rescaling; and the cost of performing basic operations, including comparison and creation of new timestamps

Constraints on parallelism beyond 10 instructions per cycle

The problem of extracting Instruction Level Parallelism at levels of 10 instructions per clock and higher is considered. Two different architectures which use speculation on memory accesses to achieve this level of performance are reviewed. It is pointed out that while this form of speculation gives high potential parallelism it is necessary to retain execution state so that incorrect speculation can be detected and subsequently squashed. Simulation results show that the space to store such state is a critical resource in obtaining good speedup. To make good use of the space it is essential that state be stored efficiently and that it be retired as soon as possible. A number of techniques for extracting the best usage from the available state storage are introduced

Applying Time Warp to CPU Design

This paper exemplifies the similarities in Time Warp and computer architecture concepts and terminology, and the continued trend for convergence of ideas in these two areas. Time Warp can provide a means to describe the complex mechanisms being used to allow the instruction execution window to be enlarged. Furthermore it can extend the current mechanisms, which do not scale, in a scaleable manner. The issues involved in implementing Time Warp in a CPU design are also examined, and illustrated with reference to the Wisconsin Multiscalar machine and the Waikato WarpEngine. Finally the potential performance gains of such a system are briefly discussed. 1. Introduction Computer designers currently face a very interesting set of challenges. The steady increase in the number of transistors on a chip and the speed at which a chip can be clocked has continued its inexorable progress. In 1997, chips with millions of transistors and clock speeds of hundreds of MHz are in routine production and..

Chlorocholine chloride and paclobutrazol treatments promote carbohydrate accumulation in bulbs of Lilium Oriental hybrids ‘Sorbonne’

The present study was to test the hypothesis that the plant growth retardants chlorocholine chloride (CCC) and paclobutrazol (PBZ) could improve the carbohydrate accumulation in lily bulbs by enhancing photosynthetic capacity and changing endogenous hormones. Plants of Lilium Oriental hybrids ‘Sorbonne’ were treated with a foliar spray of CCC or PBZ (both at 300 mg/L) solution, at six weeks after planting (6 WAP). The morphological parameters, endogenous hormone contents (gibberellic acid (GA), abscisic acid (ABA), and indole-3-acetic acid (IAA)), and carbohydrate contents were measured from 6 to 18 WAP, at 2-week intervals. The results showed that CCC increased the biomass of leaves and stems which might produce more photoassimilates available for transportation and utilization. However, PBZ treatment suppressed vegetative growth and favored photoassimilate transportation into bulbs. A slight delay of bud and anthesis formation was observed in both treated plants. CCC and PBZ treatments substantially enhanced the sucrose contents in leaves probably due to the increase of chlorophyll contents. Treatment with CCC or PBZ decreased GA but increased IAA contents in lily bulbs which might stimulate starch accumulation and formation of new scales. Our experiment suggested that CCC or PBZ treatment is an effective method to promote carbohydrate accumulation in lily bulbs