The current study aims to conduct a simulation that is useful in developing an appropriate design addresses the problem of congestion Internet network through controlling queue router. conducted proposed model for with different control systems help raising quality performance such as traditional Proportional Integral Derivative (PID) and advanced optimal by Flower Pollination Algorithm (FPA). ...

This paper presents a single-loop algorithm for system reliability-based topology optimization (SRBTO) that can account for statistical dependence between multiple limit-states, and its applications to computationally demanding topology optimization (TO) problems. A single-loop reliability-based design optimization (RBDO) algorithm replaces the inner-loop iterations to evaluate probabilistic co...

In this lecture we consider loop transformations that can be used for cache optimization. The transformations can improve cache locality of the loop traversal or enable other optimizations that have been impossible before due to bad data dependencies. Those loop transformations can be used in a very flexible way and are used repeatedly until the loop dependencies are well aligned with the memor...

Abstract This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of th...

We present a number of determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.

We present the linear loop transformation framework which is the formal basis for state of the art optimization techniques in restructuring compilers for parallel machines. The framework uniies most existing transformations and provides a systematic set of code generation techniques for arbitrary compound loop transformations. The algebraic representation of the loop structure and its transform...

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations of loops, resulting in signi cant redundancy in the overall computation. This paper presents a method and algorithms that eliminate such overla...