Fast Compaction in Hypercubes

نویسندگان

  • Nian-Feng Tzeng
  • Hsing-Lung Chen
چکیده

Compaction relocates active subcubes in a fragmented hypercube so as to produce a contiguous free region and eliminate the adverse impact of fragmentation on performance. The overhead of compaction is often contributed primarily by task migration, which makes use of disjoint paths for transmitting migrated data. Since task migration usually involves transmitting a large amount of data, the time required for migration with single paths is long, making compaction an undesirably lengthy process. This paper considers fast compaction through the use of all disjoint paths in existence for migration simultaneously from a source subcube to its target subcube, effectively reducing the size of data transmitted over a path and shortening the migration time. This approach leads to considerable savings in the compaction time for hypercubes which support circuit switching or wormhole routing, when compared with that using single migration paths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fuzzy CMAC Neural Network Model Based on Credit Assignment

In order to improve online learning speed and accuracy of CMAC, a fuzzy CMAC neural network model based on credit assignment concept is designed. In the conventional CMAC and fuzzy CMAC learning scheme, the corrected amounts of errors are equally distributed into all addressed hypercubes, regardless of the credibility of those hypercubes values. The proposed improved learning approach is to use...

متن کامل

Compaction Techniques Post - Pass

ion is vital in order to achieve good compaction. With respect to side effects on performance, we made the following observations. First, the compacted programs become 2%-30% faster, with the speedup averaging approximately 11%. The main reason for this speedup is that, with code abstraction limited to infrequently executed code only, the whole-program optimizations results in far less instruct...

متن کامل

Fast and Slow Compaction in Sedimentary Basins

A mathematical model of compaction in sedimentary basins is presented and analyzed. Compaction occurs when accumulating sediments compact under their own weight, expelling pore water in the process. If sedimentation is rapid or the permeability is low, then high pore pressures can result, a phenomenon which is of importance in oil drilling operations. Here we show that one-dimensional compactio...

متن کامل

An exact, cache-localized algorithm for the sub-quadratic convolution of hypercubes

Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A method is proposed for performing exact hypercube convolution in sub-quadratic time. The method outperforms FFTPACK, called via numpy, and FFTW, called via pyfftw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1998