The block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular sub-blocks, and handles each block as a computational unit in order to increase data reuse in a hierarchical memory system. As well, the factorization method increases the degree of concurrency with the reduction of communication volumes so that it performs more eeciently on a distributed-memory multipr...

Vol. 10 No. 1 1998 Many of today’s computer applications require computation power not easily achieved by computer architectures that provide little or no parallelism. A promising alternative is the parallel architecture, more specifically, the instruction-level parallel (ILP) architecture, which increases computation during each machine cycle. ILP computers allow parallel computation of the lo...

We describe three disk scheduling algorithms that can be used in a multimedia server for sustaining a number of heterogeneous variable-rate data streams. A data stream is supported by repeatedly fetching a block of data from the storage device and storing it in a corresponding buffer. For each of the disk scheduling algorithms we give necessary and sufficient conditions for avoiding underand ov...

Scheduling trains on a single railway line is an issue in it own right, and is a building block for scheduling trains in railway networks. A local, state dependent, travel advance strategy combined with a discrete event model of a railway line represent a more efficient way of approaching the scheduling problem than nonlinear programming approaches used in the past. The approach also eliminates...

This paper proposes a static scheduling of an application designed using the IEC 61499 standard. In this standard, a function block (FB) is an event triggered component and an application is a FBs network. According to specifications, we propose temporal constraints on the application behavior. To verify these constraints, we propose to transform the application blocks into a particular tasks s...

In this paper, mapping algorithm has been mainly studied. The main work and contribution have been generalized as follows: Through the research of existing onchip network mapping algorithm and global optimization algorithm, a multi-step mapping algorithm for low-power consumption have been designed, which is combined with the task allocation and the task scheduling. Compared with the traditiona...

Net model for ne-grain loop scheduling. [7] S. Ha and E.A. Lee. Compile-time scheduling and assignment of data-BLOCKINow program graphs with data-dependent iteration. [12] K.K. Parhi and D.G. Messerschmitt. Statuc rate-optimal scheduling of iterative data-BLOCKINow programs via optimum unfolding. Direct synthesis of optimized DSP assembly code from signal ow block diagrams. [14] H. Printz. Auto...

The block-packing problem has applications in chip design, factory layout, container shipment optimization, scheduling and other areas. It has been actively studied in the last 20 years, but symmetry in packings has been neglected. Our work deals with symmetry in several formulations of block-packing, including optimization and constraint-satisfaction variants, as well as slicing and non-slicin...

In multi-element deposits, different blocks are blended together to create a product with a predetermined quality. Generally, blending aims to obtain a special quality and quantity based on determining the processing plant or customer needs. However, blending causes different products based on the deposit properties. Thus, a block is blended with others to create one of many possible products. ...