TITLE

Editor's Foreword

AUTHOR(S)
Spirakis, Paul
PUB. DATE
January 1997
SOURCE
Theory of Computing Systems;1997, Vol. 30 Issue 1, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Introduces a series of articles about computing systems. Parallel algorithms and architectures.
ACCESSION #
8855553

 

Related Articles

  • Parallel Algorithms for the Circuit Value Update Problem. Leiserson, C. E.; Randall, K. H. // Theory of Computing Systems;1997, Vol. 30 Issue 6, p583 

    The circuit value update problem is the problem of updating values in a representation of a combinational circuit when some of the inputs are changed. We assume for simplicity that each combinational element has bounded fan-in and fan-out and can be evaluated in constant time. This problem is...

  • Automatic Loop Parallelization. Kumar, M.; Patnaik, L. M. // Computer Journal;1997, Vol. 40 Issue 6, p301 

    An introduction is presented in which the authors discuss various articles within the issue on topics including loop parallelization, loop fusion algorithm, and parallel computing paradigms.

  • A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers. Dehne, F.; Deng, X.; Dymond, P.; Fabri, A.; Khokhar, A. A. // Theory of Computing Systems;1997, Vol. 30 Issue 6, p547 

    We present a randomized parallel algorithm for constructing the threedimensional convex hull on a generic p-processor coarse-grained multicomputer with arbitrary interconnection network and n/p local memory per processor, where n/p ≥p[sup 2+ε] (for some arbitrarily small ε > 0). For...

  • Dynamic Generation of Discrete Random Variates. Matias, Yossi; Vitter, Jeffrey Scott; Ni, Wen-Chun // Theory of Computing Systems;Jul/Aug2003, Vol. 36 Issue 4, p329 

    We present and analyze efficient new algorithms for generating a random variate distributed according to a dynamically changing set of N weights. The base version of each algorithm generates the discrete random variate in O(log* N) expected time and updates a weight in O(2[SUPlog*N]) expected...

  • Qualitative Parametric Comparison of Load Balancing Algorithms in Parallel and Distributed Computing Environment. Chhabra, Amit; Singh, Gurvinder; Waraich, Sandeep Singh; Sidhu, Bhavneet; Kumar, Gaurav // Enformatika;2006, Vol. 16, p39 

    Decrease in hardware costs and advances in computer networking technologies have led to increased interest in the use of large-scale parallel and distributed computing systems. One of the biggest issues in such systems is the development of effective techniques/algorithms for the distribution of...

  • Parallel algorithm for solving linear programming problem under conditions of incomplete data. Sokolinskaya, I. M.; Sokolinskii, L. B. // Automation & Remote Control;Jul2010, Vol. 71 Issue 7, p1452 

    Approach to solve linear programming problem under nonformalized constraints is proposed. The approach is designed for multiprocessor computing systems with massive parallel processing.

  • A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment. Govil, Kapil; Kumar, Avanish // International Journal of Computer Applications;Jun2011, Vol. 23, p1 

    The Distributed Processing Environment [DPE] in which services provided for the network reside at multiple sites. Instead of single large machine being responsible for all aspects of process, each separate processor handles subset. In the distributed environments the program or tasks are also...

  • Research on Parallel Yen Algorithms on GPUs using CUDA. LI JianFu // Applied Mechanics & Materials;2014, Issue 519-520, p90 

    With the arrival of the intermodality era, to design fast and efficient K shortest paths(KSP) algorithms becomes gradually one of the core technologies in traveler information systems. Yen is a classical algorithm for KSP. However, Yen is time-consuming. In view of powerful general-purpose...

  • Algorithmic aspects of graph reduction for hardware/software partitioning. Jiang, Guiyuan; Wu, Jigang; Lam, Siew-Kei; Srikanthan, Thambipillai; Sun, Jizhou // Journal of Supercomputing;Jun2015, Vol. 71 Issue 6, p2251 

    The hardware/software (HW/SW) partitioning is a major concern in heterogeneous multi-processor system-on-a-chip design, where the large design space prohibits rapid identification of optimal HW/SW solutions to meet tight time-to-market constraints. In this paper, we propose graph reduction...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics