Parallelizing the construction of indirect access arrays for shared-memory machines

Communications in Numerical Methods in Engineering

Volumn 14, Issue 8, 1998, Pages 773-781

  Tuszyński, Jarosław ^a   Löhner, Rainald ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

Indirect address lists; Shared memory parallel machines; Unstructured grids

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; PARALLEL ALGORITHMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

INDIRECT ACCESS ARRAYS; SHARED-MEMORY PARALLEL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0032139747     PISSN: 10698299     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-0887(199808)14:8<773::AID-CNM186>3.0.CO;2-5     Document Type: Article

References (2)

1. R. Sedgewick, Algorithms in C, Addison Wesley, 1990.
2. O. C. Zienkiewicz and R. Taylor, The Finite Element Method, McGraw Hill, 1988.