IPPS 2000 - PDF Preprint Papers

IPPS 2000 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-2000 Paper

click to vote

IPPS
2000
IEEE

237views Distributed And Parallel Com...» more IPPS 2000»

Fast and Scalable Parallel Matrix Computations with Optical Buses

13 years 9 months ago

Download ipdps.cc.gatech.edu

Keqin Li

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	237	Fast and Scalable Parallel Matrix Computations with Optical Buses	claim
2	199	ACDS: Adapting Computational Data Streams for High Performance	claim
3	177	Declarative Concurrency in Java	claim
4	175	Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2D Torus/Mesh	claim
5	173	JavaSpMT: A Speculative Thread Pipelining Parallelization Model for Java Programs	claim
6	166	FANTOMAS: Fault Tolerance for Mobile Agents in Clusters	claim
7	164	Incorporating Non-functional Requirements into Software Architectures	claim
8	161	Compiling Process Algebraic Descriptions into Reconfigurable Logic	claim
9	160	Quality of Service Negotiation for Distributed, Dynamic Real-Time Systems	claim
10	157	Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?	claim
11	157	A General Parallel Simulated Annealing Library and its Application in Airline Industry	claim
12	154	Using Logs to Increase Availability in Real-Time Main-Memory Database	claim
13	152	Predictability and Resource Management in Distributed Multimedia Presentations	claim
14	151	Accommodating QoS Prediction in an Adaptive Resource Management Framework	claim
15	150	Certification of System Architecture Dependability	claim
16	147	Run-Time Support for Adaptive Load Balancing	claim
17	147	Parallel Information Retrieval on an SCI-Based PC-NOW	claim
18	147	A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models	claim
19	147	Monotonic Counters: A New Mechanism for Thread Synchronization	claim
20	147	Mobile Agents to Automate Fault Management in Wireless and Mobile Networks	claim
21	146	MPJ: A Proposed Java Message Passing API and Environment for High Performance Computing	claim
22	144	S3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors	claim
23	144	An Open Market-Based Architecture for Distributed Computing	claim
24	142	A Portable and Adaptative Multi-protocol Communication Library for Multithreaded Runtime Systems	claim
25	142	Combining Fusion Optimizations and Piecewise Execution of Nested Data-Parallel Programs	claim
26	140	Controlling Distributed Shared Memory Consistency from High Level Programming Languages	claim
27	139	JRoute: A Run-Time Routing API for FPGA Hardware	claim
28	139	Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults	claim
29	139	Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems	claim
30	137	Reducing Ownership Overhead for Load-Store Sequences in Cache-Coherent Multiprocessors	claim
31	137	Thread Migration and Load Balancing in Non-Dedicated Environments	claim
32	137	Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort	claim
33	136	Parallelizability of Some P-Complete Problems	claim
34	135	Enhancing NWS for Use in an SNMP Managed Internetwork	claim
35	134	Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems	claim
36	133	Fault-Tolerant Distributed-Shared-Memory on a Broadcast-Based Interconnection Network	claim
37	133	Dynamic Data Layouts for Cache-Conscious Factorization of DFT	claim
38	132	Parallel Maximum-Likelihood Inversion for Estimating Wavenumber-Ordered Spectra in Emission Spectroscopy	claim
39	132	Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping	claim
40	132	MAJC-5200: A High Performance Microprocessor for Multimedia Computing	claim
41	131	Network Load Monitoring in Distributed Systems	claim
42	130	A Novel Superscalar Architecture for Fast DCT Implementation	claim
43	129	Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers	claim
44	129	Deterministic Replay of Distributed Java Applications	claim
45	128	High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?	claim
46	128	Fault Tolerant Wide-Area Parallel Computing	claim
47	127	Network Survivability Simulation of a Commercially Deployed Dynamic Routing System Protocol	claim
48	127	Bounded-Response-Time Self-Stabilizing OPS5 Production Systems	claim
49	127	PaDDMAS: Parallel and Distributed Data Mining Application Suite	claim
50	126	Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques	claim
51	126	DyRecT: Software Support for Adaptive Parallelism on NOWs	claim
52	125	Autonomous Consistency Technique in Distributed Database with Heterogeneous Requirements	claim
53	125	A Quantitative Assessment of Thread-Level Speculation Techniques	claim
54	125	Sorting on the OTIS-Mesh	claim
55	123	Multiprocessor Scheduling with Support by Genetic Algorithms-Based Learning Classifier System	claim
56	123	Effective Load Sharing on Heterogeneous Networks of Workstations	claim
57	122	Parallel Parsing of MPEG Video in a Multi-threaded Multiprocessor Environment	claim
58	122	Fast Measurement of LogP Parameters for Message Passing Platforms	claim
59	122	On Sorting an Intransitive Total Ordered Set Using Semi-Heap	claim
60	121	Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler	claim
61	121	Image Layer Decomposition for Distributed Real-Time Rendering on Clusters	claim
62	120	PDRS: A Performance Data Representation System	claim
63	119	Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System	claim
64	119	Design and Evaluation of I/O Strategies for Parallel Pipelined STAP Applications	claim
65	119	Consensus Based on Failure Detectors with a Perpetual Accuracy Property	claim
66	119	Improving Throughput and Utilization in Parallel Machines through Concurrent Gang	claim
67	118	Parallel Management of Large Dynamic Shared Memory Space: A Hierarchical FEM Application	claim
68	118	Performance of On-Chip Multiprocessors for Vision Tasks	claim
69	118	A Component Framework for Communication in Distributed Applications	claim
70	118	Real-Time Transaction Processing Using Two-Stage Validation in Broadcast Disks	claim
71	118	Supporting Fault-Tolerant Real-Time Applications Using the RED-Linux General Scheduling Framework	claim
72	118	Optimization of Motion Estimator for Run-Time-Reconfiguration Implementation	claim
73	118	ATOLL, a New Switched, High Speed Interconnect in Comparison to Myrinet and SCI	claim
74	116	Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles	claim
75	116	Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks	claim
76	116	Building a Reliable Message Delivery System Using the CORBA Event Service	claim
77	116	The Parallelization of a Knowledge Discovery System with Hypergraph Representation	claim
78	116	Solving Problems on Parallel Computers by Cellular Programming	claim
79	116	The Heterogeneous Bulk Synchronous Parallel Model	claim
80	116	Developing an Open Architecture for Performance Data Mining	claim
81	115	Loop Pipelining and Optimization for Run Time Reconfiguration	claim
82	115	Switch Scheduling in the Multimedia Router (MMR)	claim
83	115	A Java Applet to Visualize Algorithms on Reconfigurable Mesh	claim
84	115	Pulse-Modulated Vision Chips with Versatile-Interconnected Pixels	claim
85	115	A Decision-Process Analysis of Implicit Coscheduling	claim
86	115	Congestion-Free Routing of Streaming Multimedia Content in BMIN-Based Parallel Systems	claim
87	115	Memory Management in a Combined VIA/SCI Hardware	claim
88	114	Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification	claim
89	114	Template Based Structured Collections	claim
90	114	Take Advantage of the Computing Power of DNA Computers	claim
91	113	Optoelectronic-VLSI Technology: Terabit/s I/O to a VLSI Chip	claim
92	113	Real-Time Coordination in Distributed Multimedia Systems	claim
93	113	A Requirements Analysis for Parallel KDD Systems	claim
94	112	Performance Issues for Multi-language Java Applications	claim
95	112	Power-Aware Localized Routing in Wireless Networks	claim
96	111	Implementing Java Consistency Using a Generic, Multithreaded DSM Runtime System	claim
97	111	On Identifying Strongly Connected Components in Parallel	claim
98	111	A Segmented Backup Scheme for Dependable Real Time Communication in Multihop Networks	claim
99	111	Exploring the Switch Design Space in a CC-NUMA Multiprocessor Environment	claim
100	111	A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems	claim
101	111	Support for Recoverable Memory in the Distributed Virtual Communication Machine	claim
102	111	On the Scheduling Algorithm of the Dynamically Trace Scheduled VLIW Architecture	claim
103	111	A Reconfigurable Content Addressable Memory	claim
104	110	RPV: A Programming Environment for Real-Time Parallel Vision - Specification and Programming Methodology	claim
105	110	Tutorial 2: A Foundation for Composing Concurrent Objects	claim
106	110	Architecture Description and Prototype Demonstration of Optoelectronic Parallel-Matching Architecture	claim
107	110	Job Scheduling that Minimizes Network Contention due to both Communication and I/O	claim
108	110	A Mechanism for Speculative Memory Accesses Following Synchronizing Operations	claim
109	109	A Parallel Co-evolutionary Metaheuristic	claim
110	109	Parallel Low-Level Image Processing on a Distributed-Memory System	claim
111	109	Online Computation of Critical Paths for Multithreaded Languages	claim
112	109	Module Allocation for Dynamically Reconfigurable Systems	claim
113	109	Applying Interposition Techniques for Performance Analysis of OpenMP Parallel Applications	claim
114	108	A Method for Automatic Cryptographic Protocol Verification	claim
115	108	Hardware Support for Simulated Annealing and Tabu Search	claim
116	108	Parallel Data Mining of Bayesian Networks from Telecommunications Network Data	claim
117	107	Speed vs. Accuracy in Simulation for I/O-Intensive Applications	claim
118	107	A PC-NOW Based Parallel Extension for a Sequential DBMS	claim
119	107	Reduction Optimization in Heterogeneous Cluster Environments	claim
120	107	Information Exchange in Multi Colony Ant Algorithms	claim
121	107	Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing	claim
122	107	A Distributed Real Time Coordination Protocol	claim
123	107	Components Are from Mars	claim
124	106	Parallelization Techniques for Spatial-Temporal Occupancy Maps from Multiple Video Streams	claim
125	106	On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations	claim
126	106	Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network	claim
127	105	Broadcasting in Hypercubes in the Circuit Switched Model	claim
128	105	Using Switch Directories to Speed Up Cache-to-Cache Transfers in CC-NUMA Multiprocessors	claim
129	104	Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems	claim
130	104	Fast Synchronization on Scalable Cache-Coherent Multiprocessors using Hybrid Primitives	claim
131	103	An Efficient Backup-Overloading for Fault-Tolerant Scheduling of Real-Time Tasks	claim
132	103	Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations	claim
133	103	A Framework for Embedded Real-Time System Design	claim
134	103	Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks	claim
135	103	Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks	claim
136	102	Optimizing Retrieval and Processing of Multi-Dimensional Scientific Datasets	claim
137	102	Connectivity Models for Optoelectronic Computing Systems	claim
138	102	A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method	claim
139	101	Safe Caching in a Distributed File System for Network Attached Storage	claim
140	101	Optoelectronic Multi-chip Modules Based on Imaging Fiber Bundle Structures	claim
141	101	De Bruijn Isomorphisms and Free Space Optical Networks	claim
142	101	A New Computation of Shape Moments via Quadtree Decomposition	claim
143	100	Micro-Architectures of High Performance, Multi-User System Area Network Interface Cards	claim
144	100	Optimal Periodic Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems	claim
145	100	Performance of the IBM General Parallel File System	claim
146	100	Advanced Data Layout Optimization for Multimedia Applications	claim
147	100	Was Collective Intelligence before Life on Earth?	claim
148	100	Augmenting Modern Superscalar Architectures with Configurable Extended Instructions	claim
149	98	Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems	claim
150	98	An Optimal Parallel Algorithm for Computing Moments on Arrays with Reconfigurable Optical Buses	claim
151	97	Register Assignment for Software Pipelining with Partitioned Register Banks	claim
152	97	Exploiting Hierarchy in Parallel Computer Networks to Optimize Collective Operation Performance	claim
153	97	Clix - A Hybrid Programming Environment for Distributed Objects and Distributed Shared Memory	claim
154	97	A Probabilistic Power Prediction Tool for the Xilinx 4000-Series FPGA	claim
155	97	Viewing Scheduling Problems through Genetic and Evolutionary Algorithms	claim
156	96	Adaptive Routing in RS/6000 SP-Like Bidirectional Multistage Interconnection Networks	claim
157	96	On Stalling in LogP	claim
158	96	Fair and Efficient Packet Scheduling in Wormhole Networks	claim
159	96	A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants	claim
160	96	A Runtime System for Dynamic DAG Programming	claim
161	95	Predicting Performance on SMPs. A Case Study: The SGI Power Challenge	claim
162	95	An Open Framework for Real-Time Scheduling Simulation	claim
163	95	Workshop on Optics and Computer Science (WOCS 2000)	claim
164	95	Study of a Multilevel Approach to Partitioning for Parallel Logic Simulation	claim
165	95	Power-Aware Replication of Data Structures in Distributed Embedded Real-Time Systems	claim
166	94	Computing in the RAIN: A Reliable Array of Independent Nodes	claim
167	94	Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System	claim
168	94	Computing Distance Maps Efficiently Using an Optical Bus	claim
169	94	Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations	claim
170	94	Specification Techniques for Automatic Performance Analysis Tools	claim
171	93	Gang Scheduling with Memory Considerations	claim
172	93	Scalable Parallel Clustering for Data Mining on Multicomputers	claim
173	92	Agent Surgery: The Case for Mutable Agents	claim
174	92	Refinement Based Validation of an Algorithm for Detecting Distributed Termination	claim
175	92	Scalable Monitoring Technique for Detecting Races in Parallel Programs	claim
176	91	Distributed Models and Algorithms for Survivability in Network Routing	claim
177	91	Parallelisation of C4.5 as a Particular Divide and Conquer Computation	claim
178	91	ClusterNet: An Object-Oriented Cluster Network	claim
179	91	Pipelining Wavefront Computations: Experiences and Performance	claim
180	91	Efficient Integration of Compiler-Directed Cache Coherence and Data Prefetching	claim
181	91	Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors	claim
182	91	Non-Memory-Based and Real-Time Zerotree Building for Wavelet Zerotree Coding Systems	claim
183	91	Concurrent Specification and Timing Analysis of Digital Hardware Using SDL	claim
184	91	Neural Fraud Detection in Mobile Phone Operations	claim
185	91	Verification Methods for Weaker Shared Memory Consistency Models	claim
186	90	The MultiCluster Model to the Integrated Use of Multiple Workstation Clusters	claim
187	90	Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses	claim
188	90	The Memory Bandwidth Bottleneck and its Amelioration by a Compiler	claim
189	90	Present and Future Needs of Free-Space Optical Interconnects	claim
190	90	The Fuzzy Philosophers	claim
191	89	A Distributed Computing Demonstration System Using FSOI Inter-processor Communication	claim
192	89	Exploiting Dataset Similarity for Distributed Mining	claim
193	89	A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids	claim
194	89	Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks	claim
195	88	Skiplist-Based Concurrent Priority Queues	claim
196	87	MPI Collective Operations over IP Multicast	claim
197	87	A Hardware Implementation of PRAM and Its Performance Evaluation	claim
198	87	Scalable Model for Extensional and Intensional Descriptions of Unclassified Data	claim
199	87	Three Dimensional VLSI-Scale Interconnects	claim
200	86	Automatic Implementation of Distributed Systems Formal Specifications	claim
201	86	Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives	claim
202	86	Parallel Lagrange Interpolation on the Star Graph	claim
203	85	Multithreaded Parallel Computer Model with Performance Evaluation	claim
204	85	Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time	claim
205	85	Integrating Kernel Activations in a Multithreaded Runtime System on Top of LINUX	claim
206	84	A Non-binary Parallel Arithmetic Architecture	claim
207	83	Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion	claim
208	83	The Cellular Processor Architecture CEPRA-1X and Its Configuration by CDL	claim
209	83	Executing Communication-Intensive Irregular Programs Efficiently	claim
210	82	Using Postordering and Static Symbolic Factorization for Parallel Sparse LU	claim
211	82	Sorting Multisets in Anonymous Rings	claim
212	82	Caching Single-Assignment Structures to Build a Robust Fine-Grain Multi-Threading System	claim
213	81	Models Supporting Nondeterminism and Probabilistic Choice	claim
214	80	Load Balancing Strategies for Dense Linear Algebra Kernels on Heterogeneous Two-Dimensional Grids	claim
215	79	Repartitioning Unstructured Adaptive Meshes	claim
216	78	Efficient Parallelization of Unstructured Reductions on Shared Memory Parallel Architectures	claim
217	76	CORBA Based Runtime Support for Load Distribution and Fault Tolerance	claim
218	74	A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers