IPPS 1999 - PDF Preprint Papers

IPPS 1999 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-1999 Paper

click to vote

IPPS
1999
IEEE

278views Distributed And Parallel Com...» more IPPS 1999»

Efficient Parallel Algorithms for Selection and Multiselection on Mesh-Connected Computers

14 years 4 months ago

Download ipdps.cc.gatech.edu

Hong Shen

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	278	Efficient Parallel Algorithms for Selection and Multiselection on Mesh-Connected Computers	claim
2	219	A Parallel Phoneme Recognition Algorithm Based on Continuous Hidden Markov Model	claim
3	215	Design and Implementation of a Scalable Parallel System for Multidimensional Analysis and OLAP	claim
4	203	BSP in CSP: Easy as ABC	claim
5	200	A Structured Approach to Parallel Programming: Methodology and Models	claim
6	200	FPGA Implementation of Modular Exponentiation	claim
7	192	Process Networks as a High-Level Notation for Metacomputing	claim
8	191	Mechanical Verification of a Garbage Collector	claim
9	191	DynBench: A Dynamic Benchmark Suite for Distributed Real-Time Systems	claim
10	188	The Impact of Memory Hierarchies on Cluster Computing	claim
11	187	Low-Latency Message Passing on Workstation Clusters using SCRAMNet	claim
12	186	Scalable Hardware-Algorithms for Binary Prefix Sums	claim
13	183	Reconfigurable Parallel Sorting and Load Balancing: HeteroSort	claim
14	182	Dependability Evaluation of Fault Tolerant Distributed Industrial Control Systems	claim
15	176	A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem	claim
16	174	A Distributed System Reference Architecture for Adaptive QoS and Resource Management	claim
17	172	Distributed, Scalable, Dependable Real-Time Systems: Middleware Services and Applications	claim
18	171	The MuSE System: A Flexible Combination of On-Stack Execution and Work-Stealing	claim
19	169	An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time")	claim
20	169	Cashmere-VLM: Remote Memory Paging for Software Distributed Shared Memory	claim
21	169	Concurrent Language Support for Interoperable Applications	claim
22	169	Non-Preemptive Scheduling of Real-Time Threads on Multi-Level-Context Architectures	claim
23	169	Run-Time Selection of Block Size in Pipelined Parallel Programs	claim
24	167	A Parallel Genetic Algorithm for Task Mapping on Parallel Machines	claim
25	167	Leonardo and Discipulus Simplex: An Autonomous, Evolvable Six-Legged Walking Robot	claim
26	166	Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications	claim
27	166	The Biological Basis of the Immune System as a Model for Intelligent Agents	claim
28	166	A Formal Definition of the Phenomenon of Collective Intelligence and its IQ Measure	claim
29	164	A Graph Based Method for Generating the Fiedler Vector of Irregular Problems	claim
30	164	Parallel Algorithms for 3D Reconstruction of Asymmetric Objects from Electron Micrographs	claim
31	161	A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality	claim
32	158	Plastic Cell Architecture: A Dynamically Reconfigurable Hardware-Based Computer	claim
33	157	Ubiquitous Message Passing Interface Implementation in Java: jmpi	claim
34	157	Dynamic Process Composition and Communication Patterns in Irregularly Structured Applications	claim
35	156	Cascaded Execution: Speeding Up Unparallelized Execution on Shared-Memory Multiprocessors	claim
36	156	A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation	claim
37	156	A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems	claim
38	155	Condition-Based Maintenance: Algorithms and Applications for Embedded High Performance Computing	claim
39	154	Large Scale Simulation of Particulate Flows	claim
40	153	Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms	claim
41	153	Implementing a Non-Strict Functional Programming Language on a Threaded Architecture	claim
42	151	An Approach for Measuring IP Security Performance in a Distributed Environment	claim
43	151	Real-Time Image Processing on a Focal Plane SIMD Array	claim
44	148	A Communication Latency Hiding Parallelization of a Traffic Flow Simulation	claim
45	147	On the Design and Evaluation of Job Scheduling Algorithms	claim
46	146	Improving Collective I/O Performance Using Threads	claim
47	146	An Object-Oriented Environment for Sparse Parallel Computation on Adaptive Grids	claim
48	146	Optimization Rules for Programming with Collective Operations	claim
49	145	NWCache: Optimizing Disk Accesses via an Optical Network/Write Cache Hybrid	claim
50	145	Examples of Program Composition Illustrating the Use of Universal Properties	claim
51	145	Developing Parallel Applications Using the JAVAPORTS Environment	claim
52	145	A Parallel Adaptive version of the Block-based Gauss-Jordan Algorithm	claim
53	145	Qos Control and Adaptation in Distributed Multimedia Systems	claim
54	144	A Genetic-Based Fault-Tolerant Routing Strategy for Multiprocessor Networks	claim
55	144	More Efficient Object Serialization	claim
56	143	Application Performance of a Linux Cluster Using Converse	claim
57	142	An Efficient Implementation Method of Fractal Image Compression on Dynamically Reconfigurable Architecture	claim
58	142	Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance	claim
59	141	Constant-Time Algorithm for Medial Axis Transform on the Reconfigurable Mesh	claim
60	140	Shuffle Memory System	claim
61	139	A Formal Framework for Specifying and Verifying Time Warp Optimizations	claim
62	139	All-to-All Broadcast on Switch-Based Clusters of Workstations	claim
63	139	Fault-Tolerant Routing Algorithms for Hypercube Networks	claim
64	139	Mapping Media Streams onto a Network of Servers	claim
65	139	An Adaptive, Fault-Tolerant Implementation of BSP for JAVA-Based Volunteer Computing Systems	claim
66	138	Automatic Array Alignment in Parallel Matlab Scripts	claim
67	138	Using Channels for Multimedia Communication	claim
68	138	Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic	claim
69	138	A Fast Multithreaded Out-of-Core Visualization Technique	claim
70	138	A Factorial Performance Evaluation for Hierarchical Memory Systems	claim
71	137	Infrastructure for Building Parallel Database Systems for Multi-Dimensional Data	claim
72	137	Experimental Evaluation of QSM, a Simple Shared-Memory Model	claim
73	137	Lazy Logging and Prefetch-Based Crash Recovery in Software Distributed Shared Memory Systems	claim
74	137	Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System	claim
75	137	Application of Parallel Processors to Real-Time Sensor Array Processing	claim
76	137	Transparent Real-Time Monitoring in MPI	claim
77	136	ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems	claim
78	135	A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes	claim
79	135	PM-PVM: A Portable Multithreaded PVM	claim
80	134	Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs	claim
81	134	Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs	claim
82	134	Building an Adaptive Multimedia System using the Utility Model	claim
83	134	Domain Specific Mapping for Solving Graph Problems on Reconfigurable Devices	claim
84	133	BRISK: A Portable and Flexible Distributed Instrumentation System	claim
85	133	GA-Based Parallel Image Registration on Parallel Clusters	claim
86	133	A Consistent History Link Connectivity Protocol	claim
87	132	MPIJAVA: An Object-Oriented JAVA Interface to MPI	claim
88	132	A Transformational Framework for Skeletal Programs: Overview and Case Study	claim
89	132	Deterministic Batch Scheduling without Static Partitioning	claim
90	131	Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors	claim
91	131	Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees	claim
92	131	Compiler Analysis to Support Compiled Communication for HPF-Like Programs	claim
93	130	Sparse Computations with PEI	claim
94	129	DEFACTO: A Design Environment for Adaptive Computing Technology	claim
95	129	Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management	claim
96	129	Oblivious Deadlock-Free Routing in a Faulty Hypercube	claim
97	129	Configuration Sequencing with Self Configurable Binary Multipliers	claim
98	128	Addressing Real-Time Requirements of Automatic Vehicle Guidance with MMX Technology	claim
99	127	Implementation of a Virtual Time Synchronizer for Distributed Databases	claim
100	127	Fully-Scalable Fault-Tolerant Simulations for BSP and CGM	claim
101	127	An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic	claim
102	127	Reducing Parallel Overheads Through Dynamic Serialization	claim
103	126	Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative Caches	claim
104	126	Tailor-Made Operating Systems for Embedded Parallel Applications	claim
105	126	Reducing System Overheads in Home-based Software DSMs	claim
106	126	Hardwired-Clusters Partial-Crossbar: A Hierarchical Routing Architecture for Multi-FPGA Systems	claim
107	126	The Performance of Coordinated and Independent Checkpointing	claim
108	125	Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads	claim
109	125	COWL: Copy-On-Write for Logic Programs	claim
110	125	Scalable Parallelization of Harmonic Balance Simulation	claim
111	125	Delivering On Standards, Balancing Portability and Performance	claim
112	125	Dynamically Scheduling the Trace Produced During Program Execution into VLIW Instructions	claim
113	124	A Customizable Implementation of RMI for High Performance Computing	claim
114	124	Prefix Computations on Symmetric Multiprocessors	claim
115	123	NetCache: A Network/Cache Hybrid for Multiprocessors	claim
116	123	OTIS-Based Multi-Hop Multi-OPS Lightwave Networks	claim
117	123	A Dynamic Fault-Tolerant Mesh Architecture	claim
118	123	PARADIGM (version 2.0): A New HPF Compilation System	claim
119	123	LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems	claim
120	123	Asynchronous Group Mutual Exclusion in Ring Networks	claim
121	122	High-Performance Knowledge Extraction from Data on PC-Based Networks of Workstations	claim
122	122	Hiding Communication Latency in Reconfigurable Message-Passing Environments	claim
123	122	Large Scale Simulation of Parallel Molecular Dynamics	claim
124	122	A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems	claim
125	122	An Efficient Logging Algorithm for Incremental Replay of Message	claim
126	121	High Speed, High Capacity Bused Interconnects using Optical Slab Waveguides	claim
127	121	Dynamic Interval Routing on Asynchronous Rings	claim
128	120	Segment Directory Enhancing the Limited Directory Cache Coherence Schemes	claim
129	120	Parallel Ant Colonies for Combinatorial Optimization Problems	claim
130	120	Relaxing Causal Constraints in PDES	claim
131	119	An On-Line Arithmetic-Based Reconfigurable Neuroprocessor	claim
132	119	The Computational Co-op: Gathering Clusters into a Metacomputer	claim
133	119	Sparse Hypercube: A Minimal k-Line Broadcast Graph	claim
134	119	Interconnect Synthesis for Reconfigurable Multi-FPGA Architectures	claim
135	118	Optimizing Irregular HPF Applications using Halos	claim
136	118	Parallel Load Balancing for Problems with Good Bisectors	claim
137	118	The Paderborn University BSP (PUB) Library - Design, Implementation and Performance	claim
138	118	Randomized Initialization Protocols for Packet Radio Networks	claim
139	118	Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors	claim
140	117	The Case for Prediction-Based Best-Effort Real-Time Systems	claim
141	117	Coscheduling through Synchronized Scheduling Servers - A Prototype and Experiments	claim
142	117	A Performance Model of Speculative Prefetching in Distributed Information Systems	claim
143	117	Optimal Scheduling Algorithms in WDM Optical Passive Star Networks	claim
144	116	Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms	claim
145	116	Bit Summation on the Reconfigurable Mesh	claim
146	115	Parallel Biological Sequence Comparison Using Prefix Computations	claim
147	115	From a Specification to an Equivalence Proof in Object-Oriented Parallelism	claim
148	115	Irregular Parallel Algorithms in JAVA	claim
149	115	Towards an Effective Task Clustering Heuristic for LogP Machines	claim
150	115	Efficient Communications in Multithreaded Runtime Systems	claim
151	114	Sparse Matrix Block-Cyclic Redistribution	claim
152	114	A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid Applications	claim
153	114	Performance Results for a Reliable Low-Latency Cluster Communication Protocol	claim
154	114	A Range Minima Parallel Algorithm for Coarse Grained Multicomputers	claim
155	114	SCALA: A Framework for Performance Evaluation of Scalable Computing	claim
156	114	Communication-Intensive Parallel Applications and Non-dedicated Clusters of Workstations	claim
157	113	Flexible Collective Operations for Distributed Object Groups	claim
158	113	Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach	claim
159	113	Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes	claim
160	112	System Support for Migratory Continuous Media	claim
161	112	Implementation and Evaluation of MPI on an SMP Cluster	claim
162	112	The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks	claim
163	111	High Performance Computing for the Masses	claim
164	111	Improved Scaling Simulation of the General Reconfigurable Mesh	claim
165	111	Marshaling/Demarshaling as a Compilation/Interpretation Process	claim
166	111	Better Deterministic Routing on Meshes	claim
167	111	Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses	claim
168	110	Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines	claim
169	110	A Parallel Algorithm for Bound-Smoothing	claim
170	110	tmPVM - Task Migratable PVM	claim
171	109	Low Cost Databases for NOW	claim
172	109	Self-Avoiding Walks over Adaptive Unstructured Grids	claim
173	109	Permutation Routing in All-Optical Product Networks	claim
174	108	The Characterization of Data-Accumulating Algorithms	claim
175	106	Recursive Individually Distributed Object	claim
176	106	VBMAR: Virtual Network Load Balanced Minimal Adaptive Routing	claim
177	105	Efficient Program Partitioning Based on Compiler Controlled Communication	claim
178	104	A Parallel Algorithm for Singular Value Decomposition as Applied to Failure Tolerant Manipulators	claim
179	104	Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering	claim
180	103	Metrics for the Evaluation of Multicast Communications	claim
181	103	Parallel Program Archetypes	claim
182	101	Dynamic Application Structuring on Heterogeneous, Distributed Systems	claim
183	101	Regularity Considerations in Instance-Based Locality Optimization	claim
184	101	A Framework for Adaptive Storage Input/Output on Computational Grids	claim
185	100	Process Tracking for Parallel Job Control	claim
186	98	Optimizations for Language-Directed Computational Steering	claim
187	97	Solving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses	claim
188	96	An Environment for Generating Applications Involving Remote Manipulation of Parallel Machines	claim
189	95	Structural Biology Metaphors Applied to the Design of a Distributed Object System	claim
190	94	A new Architecture for Multihop Optical Networks	claim
191	90	OpenMP for Networks of SMPs	claim
192	89	P-EDR: An Algorithm for Parallel Implementation of Parzen Density Estimation from Uncertain Observations	claim
193	73	Reusable Internal Hardware Templates	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers