Pages that link to "Item:Q2730098"
From MaRDI portal
The following pages link to Parallel Algorithms and Applications (Q2730098):
Displayed 50 items.
- COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL (Q2730099) (← links)
- SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS (Q2735232) (← links)
- EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES (Q2735234) (← links)
- ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST (Q2735235) (← links)
- SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS (Q2735236) (← links)
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK* (Q2744172) (← links)
- IMPROVED RESOURCE UTILIZATION WITH BUFFERED COSCHEDULING (Q2744174) (← links)
- MODELS AND TRENDS IN PARALLEL PROGRAMMING (Q2744175) (← links)
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS (Q2744176) (← links)
- DISTRIBUTED SIMULATION OF HIGH-LEVEL ALGEBRAIC PETRI NETS WITH LIMITED CAPACITY PLACES (Q2744178) (← links)
- DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS (Q2755580) (← links)
- LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS (Q2755581) (← links)
- EMPLOYING<i>K</i>-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION (Q2755582) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- EIGENPAIRS OF SYMMETRIC MATRICES USING THE QUADRATIC METHOD AND THE METHOD OF SUBDEFINITE CALCULATIONS (Q2755584) (← links)
- OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (Q3130156) (← links)
- LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS (Q3130158) (← links)
- THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN (Q3130159) (← links)
- THE PARALLEL SOLUTION OF TRIDIAGONAL SYSTEMS BY RECURSIVE STRIDING (Q3130160) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH (Q3130163) (← links)
- SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM (Q3146520) (← links)
- PARALLEL CHAOTIC ALGORITHMS FOR SINGULAR LINEAR SYSTEMS (Q3146521) (← links)
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS II: MESHES∗ (Q3146522) (← links)
- RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES (Q3146523) (← links)
- EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK (Q3146524) (← links)
- PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES (Q3150026) (← links)
- NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS (Q3150027) (← links)
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS (Q3150028) (← links)
- AN O∥LOG P) PARALLEL IMPLEMENTATION OF FEEDBACK GUIDED DYNAMIC LOOP SCHEDULING (Q3150029) (← links)
- Integration of load balancing in a CORBA environment (Q3155726) (← links)
- EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES* (Q4226499) (← links)
- ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS (Q4226500) (← links)
- A FRAMEWORK FOR PARTITIONING STRUCTURED GRIDS WITH INHOMOGENEOUS WORKLOAD (Q4226501) (← links)
- PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS (Q4226502) (← links)
- OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS* (Q4226503) (← links)
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION (Q4238523) (← links)
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION (Q4238524) (← links)
- BLOCK ITERATIVE METHODS FOR ONE DIMENSIONAL NONLINEAR BIHARMONIC PROBLEMS ON A PARALLEL COMPUTER* (Q4238525) (← links)
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS* (Q4238526) (← links)
- FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM (Q4240886) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- A PARALLEL DEMAND-DRIVEN SIMULATION ALGORITHM FOR SIMD COMPUTERS (Q4240888) (← links)
- PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗ (Q4240889) (← links)
- SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS (Q4242704) (← links)
- ON THE POWER OF SOME PRAM MODELS (Q4242705) (← links)
- EFFICIENT MAPPING REDUCTIONS USING ISO-PLANES ON THE POLYTOPE MODEL (Q4242706) (← links)
- A PARALLEL FINITE ELEMENT CODE FOR NONLINEAR LEAKY AQUIFER SYSTEMS (Q4242707) (← links)
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS (Q4347261) (← links)