Authors:
GRAMMATIKAKIS MD
HSU DF
KRAETZL M
SIBEYN JF
Citation: Md. Grammatikakis et al., PACKET ROUTING IN FIXED-CONNECTION NETWORKS - A SURVEY, Journal of parallel and distributed computing (Print), 54(2), 1998, pp. 77-132
Citation: Pe. Nastou et al., AVERAGE-CASE ANALYSIS OF SEARCHING IN ASSOCIATIVE PROCESSING, Journal of parallel and distributed computing (Print), 54(2), 1998, pp. 133-161
Citation: D. Barth et P. Panaite, ROUTING PERMUTATIONS ON GRAPHS VIA FACTORS, Journal of parallel and distributed computing (Print), 54(2), 1998, pp. 162-182
Citation: Jb. Weissman, GALLOP - THE BENEFITS OF WIDE-AREA COMPUTING FOR PARALLEL-PROCESSING, Journal of parallel and distributed computing (Print), 54(2), 1998, pp. 183-205
Citation: Ri. Becker et al., THE NEW CLASS OF G-CHAIN PERIODIC SORTERS, Journal of parallel and distributed computing (Print), 54(2), 1998, pp. 206-222
Citation: Gh. Hwang et Jk. Lee, A FUNCTION-COMPOSITION APPROACH TO SYNTHESIZE FORTRAN 90 ARRAY OPERATIONS, Journal of parallel and distributed computing (Print), 54(1), 1998, pp. 1-47
Citation: Jg. Liu et al., A NOVEL-APPROACH TO FAST DISCRETE FOURIER-TRANSFORM, Journal of parallel and distributed computing (Print), 54(1), 1998, pp. 48-58
Citation: J. Wu et al., EMBEDDING OF BINOMIAL TREES IN HYPERCUBES WITH LINK FAULTS, Journal of parallel and distributed computing (Print), 54(1), 1998, pp. 59-74
Citation: L. Boxer et al., SCALEABLE PARALLEL ALGORITHMS FOR LOWER ENVELOPES WITH APPLICATIONS, Journal of parallel and distributed computing (Print), 53(2), 1998, pp. 91-118
Citation: Kq. Li et al., LOWER BOUNDS FOR DYNAMIC TREE EMBEDDING IN BIPARTITE NETWORKS, Journal of parallel and distributed computing (Print), 53(2), 1998, pp. 119-143
Citation: Hb. Lim et Pc. Yew, MAINTAINING CACHE COHERENCE THROUGH COMPILER-DIRECTED DATA PREFETCHING, Journal of parallel and distributed computing (Print), 53(2), 1998, pp. 144-173
Citation: Av. Gerbessiotis, PRACTICAL CONSIDERATIONS OF PARALLEL SIMULATIONS AND ARCHITECTURE-INDEPENDENT PARALLEL ALGORITHM DESIGN, Journal of parallel and distributed computing (Print), 53(1), 1998, pp. 1-25
Citation: E. Fleury et P. Fraigniaud, STRATEGIES FOR PATH-BASED MULTICASTING IN WORMHOLE-ROUTED MESHES, Journal of parallel and distributed computing (Print), 53(1), 1998, pp. 26-62
Citation: Pn. Swarztrauber, TRANSPOSING ARRAYS ON MULTICOMPUTERS USING DE-BRUIJN SEQUENCES, Journal of parallel and distributed computing (Print), 53(1), 1998, pp. 63-77
Citation: Mp. Connolly et P. Fitzpatrick, FAULT-TOLERANT FADDEEVA ALGORITHM, Journal of parallel and distributed computing (Print), 53(1), 1998, pp. 78-89
Citation: G. Lee et Bc. Kang, LIMITED COMBINING STRATEGIES FOR LARGE-SCALE SHARED-MEMORY MULTIPROCESSORS, Journal of parallel and distributed computing (Print), 52(2), 1998, pp. 109-119
Citation: J. Trdlicka et P. Tvrdik, EMBEDDING OF K-ARY COMPLETE TREES INTO HYPERCUBES WITH UNIFORM LOAD, Journal of parallel and distributed computing (Print), 52(2), 1998, pp. 120-131
Citation: S. Orlando et R. Perego, A COMPARISON OF IMPLEMENTATION STRATEGIES FOR NONUNIFORM DATA-PARALLEL COMPUTATIONS, Journal of parallel and distributed computing (Print), 52(2), 1998, pp. 132-149
Citation: L. Oliker et R. Biswas, PLUM - PARALLEL LOAD BALANCING FOR ADAPTIVE UNSTRUCTURED MESHES, Journal of parallel and distributed computing (Print), 52(2), 1998, pp. 150-177
Citation: Dr. Helman et al., A RANDOMIZED PARALLEL SORTING ALGORITHM WITH AN EXPERIMENTAL-STUDY, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 1-23
Citation: Sy. Kim et Ky. Chwa, MULTIPLE GRAPH EMBEDDINGS INTO A PROCESSOR ARRAY WITH SPANNING BUSES, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 24-39
Citation: Cy. Chang et P. Mohapatra, PERFORMANCE IMPROVEMENT OF ALLOCATION SCHEMES FOR MESH-CONNECTED COMPUTERS, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 40-68
Citation: Nb. Abughazaleh et Pa. Wilsey, MODELS FOR CONTROL UNIT SYNCHRONIZATION ON SHARED CONTROL ARCHITECTURES, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 69-81
Citation: Hw. Kim et al., ADAPTIVE VIRTUAL CUT-THROUGH AS A VIABLE ROUTING METHOD, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 82-95
Citation: I. Parfenoff, AN EFFICIENT PARALLEL ALGORITHM FOR MAXIMUM MATCHING FOR SOME CLASSESOF GRAPHS, Journal of parallel and distributed computing (Print), 52(1), 1998, pp. 96-108