name stringlengths 5 6 | title stringlengths 8 144 | abstract stringlengths 0 2.68k | fulltext stringlengths 1.78k 95k | keywords stringlengths 22 532 |
|---|---|---|---|---|
261998 | Practical Algorithms for Selection on Coarse-Grained Parallel Computers. | AbstractIn this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors ... | better in practice than its deterministic counterpart due to the low constant associated with the
algorithm.
Parallel selection algorithms are useful in such practical applications as dynamic distribution
of multidimensional data sets, parallel graph partitioning and parallel construction of multidimensional
binary sea... | parallel algorithms;selection;parallel computers;coarse-grained;median finding;randomized algorithms;load balancing;meshes;hypercubes |
262003 | Parallel Incremental Graph Partitioning. | AbstractPartitioning graphs into equally large groups of nodes while minimizing the number of edges between different groups is an extremely important problem in parallel computing. For instance, efficiently parallelizing several scientific and engineering applications requires the partitioning of data or tasks among p... | Introduction
Graph partitioning is a well-known problem for which fast solutions are extremely important in parallel
computing and in research areas such as circuit partitioning for VLSI design. For instance, parallelization
of many scientific and engineering problems requires partitioning data among the processors in ... | remapping;mapping;refinement;parallel;linear-programming |
262369 | Computing Accumulated Delays in Real-time Systems. | We present a verification algorithm for duration properties of real-time systems. While simple real-time properties constrain the total elapsed time between events, duration properties constrain the accumulated satisfaction time of state predicates. We formalize the concept of durations by introducing duration measures... | Introduction
Over the past decade, model checking [CE81, QS81] has emerged as a powerful tool for the automatic
verification of finite-state systems. Recently the model-checking paradigm has been extended to
real-time systems [ACD93, HNSY94, AFH96]. Thus, given the description of a finite-state system
together with its... | real-time systems;duration properties;formal verification;model checking |
262521 | Compile-Time Scheduling of Dynamic Constructs in Dataflow Program Graphs. | AbstractScheduling dataflow graphs onto processors consists of assigning actors to processors, ordering their execution within the processors, and specifying their firing time. While all scheduling decisions can be made at runtime, the overhead is excessive for most real systems. To reduce this overhead, compile-time d... | Introduction
A D ataflow graph representation, either as a programming
language or as an intermediate representation
during compilation, is suitable for programming multiprocessors
because parallelism can be extracted automatically
from the representation [1], [2] Each node, or actor, in a
dataflow graph represents eit... | macro actor;dynamic constructs;dataflow program graphs;profile;multiprocessor scheduling |
262549 | Singular and Plural Nondeterministic Parameters. | "The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice)(...TRUNCATED) | "Introduction\nThe notion of nondeterminism arises naturally in describing concurrent systems. Vario(...TRUNCATED) | many-sorted algebra;sequent calculus;nondeterminism;algebraic specification |
262588 | "Adaptive Multilevel Techniques for Mixed Finite Element Discretizations of Elliptic Boundary Value (...TRUNCATED) | "We consider mixed finite element discretizations of linear second-order elliptic boundary value pro(...TRUNCATED) | "Introduction\n.\nIn this work, we are concerned with adaptive multilevel techniques for the efficie(...TRUNCATED) | mixed finite elements;multilevel preconditioned CG iterations;a posteriori error estimator |
262640 | Decomposition of Gray-Scale Morphological Templates Using the Rank Method. | "AbstractConvolutions are a fundamental tool in image processing. Classical examples of two dimensio(...TRUNCATED) | "INTRODUCTION\nOTH linear convolution and morphological methods are\nwidely used in image processing(...TRUNCATED) | "structuring element;morphology;morphological template;template rank;convolution;template decomposit(...TRUNCATED) |
263203 | The Matrix Sign Function Method and the Computation of Invariant Subspaces. | "A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix (...TRUNCATED) | "Introduction\n. If A 2 R n\\Thetan has no eigenvalue on the imaginary axis, then the\nmatrix sign f(...TRUNCATED) | matrix sign function;invariant subspaces;perturbation theory |
263207 | An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems. | "A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was d(...TRUNCATED) | "Introduction\n. We provide a raison d'-etre for a novel spectral algorithm to reduce\nthe envelope (...TRUNCATED) | "sparse matrices;quadratic assignment problems;reordering algorithms;2-sum problem;envelope reductio(...TRUNCATED) |
263210 | Perturbation Analyses for the QR Factorization. | "This paper gives perturbation analyses for $Q_1$ and $R$ in the QR factorization $A=Q_1R$, $Q_1^TQ_(...TRUNCATED) | "Introduction\n. The QR factorization is an important tool in matrix computations\n(see for example (...TRUNCATED) | matrix equations;pivoting;condition estimation;QR factorization;perturbation analysis |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 24