Citation: S. Rajasekaran et S. Sahni, RANDOMIZED ROUTING, SELECTION, AND SORTING ON THE OTIS-MESH, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 833-840
Citation: S. Zhu et Gm. Huang, A NEW PARALLEL AND DISTRIBUTED SHORTEST-PATH ALGORITHM FOR HIERARCHICALLY CLUSTERED DATA-NETWORKS, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 841-855
Citation: Oh. Kwon et Ky. Chwa, AN ALGORITHM FOR SCHEDULING JOBS IN HYPERCUBE SYSTEMS, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 856-860
Authors:
FERNANDEZZEPEDA JA
VAIDYANATHAN R
TRAHAN JL
Citation: Ja. Fernandezzepeda et al., SCALING SIMULATION OF THE FUSING-RESTRICTED RECONFIGURABLE MESH, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 861-871
Citation: I. Ahmad et Yk. Kwok, ON EXPLOITING TASK DUPLICATION IN PARALLEL PROGRAM SCHEDULING, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 872-892
Citation: Ws. Lacy et al., THE OFFSET CUBE - A 3-DIMENSIONAL MULTICOMPUTER NETWORK TOPOLOGY USING THROUGH-WAFER OPTICS, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 893-908
Citation: M. Naor et A. Wool, ACCESS-CONTROL AND SIGNATURES VIA QUORUM SECRET SHARING, IEEE transactions on parallel and distributed systems, 9(9), 1998, pp. 909-922
Citation: Kq. Li et al., FAST AND PROCESSOR EFFICIENT PARALLEL MATRIX MULTIPLICATION ALGORITHMS ON A LINEAR-ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 705-720
Citation: Yc. Kuo et St. Huang, RECOGNIZING NONDOMINATED COTERIES AND WR-COTERIES BY AVAILABILITY, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 721-728
Citation: Sm. Harabagiu et Di. Moldovan, PARALLEL SYSTEM FOR TEXT INFERENCE USING MARKER PROPAGATIONS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 729-747
Citation: A. Boukerche et C. Tropper, A DISTRIBUTED GRAPH ALGORITHM FOR THE DETECTION OF LOCAL CYCLES AND KNOTS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 748-757
Citation: Se. Hambrusch et al., SCALABLE S-TO-P BROADCASTING ON MESSAGE-PASSING MPPS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 758-768
Citation: Ks. Mckinley, A COMPILER OPTIMIZATION ALGORITHM FOR SHARED-MEMORY MULTIPROCESSORS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 769-787
Citation: J. Cohen et al., OPTIMIZED BROADCASTING AND MULTICASTING PROTOCOLS IN CUT-THROUGH ROUTED NETWORKS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 788-802
Citation: R. Klasing, IMPROVED COMPRESSIONS OF CUBE-CONNECTED CYCLES NETWORKS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 803-812
Citation: Lh. Xu et J. Bruck, DETERMINISTIC VOTING IN DISTRIBUTED SYSTEMS USING ERROR-CORRECTING CODES, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 813-824
Citation: Knb. Murthy et al., A NEW ALGORITHM-BASED ON GIVENS ROTATIONS FOR SOLVING LINEAR-EQUATIONS ON FAULT-TOLERANT MESH-CONNECTED PROCESSORS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 825-832
Citation: G. Agrawal, INTERPROCEDURAL PARTIAL REDUNDANCY ELIMINATION WITH APPLICATION TO DISTRIBUTED-MEMORY COMPILATION, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 609-625
Citation: E. Fleury et P. Fraigniaud, A GENERAL-THEORY FOR DEADLOCK-AVOIDANCE IN WORMHOLE-ROUTED NETWORKS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 626-638
Citation: Vv. Dimakopoulos et Nj. Dimopoulos, A THEORY FOR TOTAL EXCHANGE IN MULTIDIMENSIONAL INTERCONNECTION NETWORKS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 639-649
Citation: S. Balakrishnan et F. Ozguner, A PRIORITY-DRIVEN FLOW-CONTROL MECHANISM FOR REAL-TIME TRAFFIC IN MULTIPROCESSOR NETWORKS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 664-678
Citation: Ak. Amoura et al., SCHEDULING ALGORITHMS FOR PARALLEL GAUSSIAN-ELIMINATION WITH COMMUNICATION COSTS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 679-686
Citation: S. Rajasekaran et I. Lee, PARALLEL ALGORITHMS FOR RELATIONAL COARSEST PARTITION PROBLEMS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 687-699