IPPS 2009 - PDF Preprint Papers

IPPS 2009 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-2009 Paper

click to vote

IPPS
2009
IEEE

900views Distributed And Parallel Com...» more IPPS 2009»

Singular value decomposition on GPU using CUDA

14 years 7 months ago

Download web2py.iiit.ac.in

Linear algebra algorithms are fundamental to many computing applications. Modern GPUs are suited for many general purpose processing tasks and have emerged as inexpensive high per...

Sheetal Lahabar, P. J. Narayanan

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	900	Singular value decomposition on GPU using CUDA	claim
2	253	Fast development of dense linear algebra codes on graphics processors	claim
3	232	High-order stencil computations on multicore clusters	claim
4	231	A cross-input adaptive framework for GPU program optimizations	claim
5	220	Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures	claim
6	208	Implementing OpenMP on a high performance embedded multicore MPSoC	claim
7	190	Core-aware memory access scheduling schemes	claim
8	183	Adaptative clustering Particle Swarm Optimization	claim
9	181	Designing multi-leader-based Allgather algorithms for multi-core clusters	claim
10	179	Scalability challenges for massively parallel AMR applications	claim
11	176	A metascalable computing framework for large spatiotemporal-scale atomistic simulations	claim
12	176	Using hardware transactional memory for data race detection	claim
13	175	A component-based framework for the Cell Broadband Engine	claim
14	174	CuPP - A framework for easy CUDA integration	claim
15	171	CellMR: A framework for supporting mapreduce on asymmetric cell-based clusters	claim
16	168	Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA	claim
17	168	Exploiting DMA to enable non-blocking execution in Decoupled Threaded Architecture	claim
18	167	Implementing and evaluating multithreaded triad census algorithms on the Cray XMT	claim
19	167	On the complexity of mapping pipelined filtering services on heterogeneous platforms	claim
20	167	Multi-dimensional characterization of temporal data mining on graphics processors	claim
21	167	Coupled placement in modern data centers	claim
22	166	Elastic scaling of data parallel operators in stream processing	claim
23	165	Work-first and help-first scheduling policies for async-finish task parallelism	claim
24	164	Unit disk graph and physical interference model: Putting pieces together	claim
25	163	Accelerating HMMer on FPGAs using systolic array based architecture	claim
26	162	Scalable RDMA performance in PGAS languages	claim
27	161	Competitive buffer management with packet dependencies	claim
28	159	Parallel solvers for dense linear systems for heterogeneous computational clusters	claim
29	155	Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis	claim
30	154	A global scheduling framework for virtualization environments	claim
31	154	Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA	claim
32	153	Accelerating leukocyte tracking using CUDA: A case study in leveraging manycore coprocessors	claim
33	153	Handling OS jitter on multicore multithreaded systems	claim
34	153	Filter placement on a pipelined architecture	claim
35	149	GenWrapper: A generic wrapper for running legacy applications on desktop grids	claim
36	149	High-level estimation and trade-off analysis for adaptive real-time systems	claim
37	148	A scalable auto-tuning framework for compiler optimization	claim
38	147	A fusion-based approach for tolerating faults in finite state machines	claim
39	146	Energy minimization for periodic real-time tasks on heterogeneous processing units	claim
40	143	Understanding the design trade-offs among current multicore systems for numerical computations	claim
41	143	MGST: A framework for performance evaluation of Desktop Grids	claim
42	143	Network awareness of P2P live streaming applications	claim
43	142	Annotation-based empirical performance tuning using Orio	claim
44	139	Sparse collective operations for MPI	claim
45	139	Toward adjoinable MPI	claim
46	138	Parallel Nested Monte-Carlo search	claim
47	138	Long time-scale simulations of in vivo diffusion using GPU hardware	claim
48	137	Metaheuristic traceability attack against SLMAP, an RFID lightweight authentication protocol	claim
49	135	Combating side-channel attacks using key management	claim
50	135	Ibis: Real-world problem solving using real-world grids	claim
51	134	Performance analysis of distributed intrusion detection protocols for mobile group communication systems	claim
52	134	Predictive analysis and optimisation of pipelined wavefront computations	claim
53	134	Compiler-enhanced incremental checkpointing for OpenMP applications	claim
54	133	Exploring the effect of block shapes on the performance of sparse kernels	claim
55	132	Design, implementation, and evaluation of transparent pNFS on Lustre	claim
56	131	Input-independent, scalable and fast string matching on the Cray XMT	claim
57	131	Parallel short sequence mapping for high throughput genome sequencing	claim
58	128	Treat-before-trick : Free-riding prevention for BitTorrent-like peer-to-peer networks	claim
59	126	Performance evaluation of gang scheduling in a two-cluster system with migrations	claim
60	126	Exploring the multiple-GPU design space	claim
61	126	Enabling high-performance memory migration for multithreaded applications on LINUX	claim
62	126	An analysis of the impact of multi-threading on communication performance	claim
63	125	Power-aware dynamic task scheduling for heterogeneous accelerated clusters	claim
64	125	Implementing a portable Multi-threaded Graph Library: The MTGL on Qthreads	claim
65	124	Performance projection of HPC applications using SPEC CFP2006 benchmarks	claim
66	124	Improving MPI-HMMER's scalability with parallel I/O	claim
67	123	Using a market economy to provision compute resources across planet-wide clusters	claim
68	123	Efficient microarchitecture policies for accurately adapting to power constraints	claim
69	123	Throughput-fairness tradeoff in Best Effort flow control for on-chip architectures	claim
70	122	Application profiling on Cell-based clusters	claim
71	122	Double Throughput Multiply-Accumulate unit for FlexCore processor enhancements	claim
72	121	EmBOINC: An emulator for performance analysis of BOINC projects	claim
73	121	Building a parallel pipelined external memory algorithm library	claim
74	121	Portable builds of HPC applications on diverse target platforms	claim
75	120	Dynamic iterations for the solution of ordinary differential equations on multicore processors	claim
76	120	Extending SRT for parallel applications in tiled-CMP architectures	claim
77	119	Crash fault detection in celerating environments	claim
78	119	Small-file access in parallel file systems	claim
79	118	Power-aware load balancing of large scale MPI applications	claim
80	118	Early experiences on accelerating Dijkstra's algorithm using transactional memory	claim
81	118	BarterCast: A practical approach to prevent lazy freeriding in P2P networks	claim
82	116	DMTCP: Transparent checkpointing for cluster computations and the desktop	claim
83	114	On the tradeoff between playback delay and buffer space in streaming	claim
84	111	The Weak Mutual Exclusion problem	claim
85	110	An analysis of resource costs in a public computing grid	claim
86	110	Robust CDN replica placement techniques	claim
87	110	Evaluating the use of GPUs in liver image segmentation and HMMER database searches	claim
88	110	A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid	claim
89	110	Multi-users scheduling in parallel systems	claim
90	109	Efficient large-scale model checking	claim
91	108	Information spreading in stationary Markovian evolving graphs	claim
92	106	Deadlock prevention by turn prohibition in interconnection networks	claim
93	106	Optimizing assignment of threads to SPEs on the cell BE processor	claim
94	106	Early experiences with large-scale Cray XMT systems	claim
95	105	Performance modeling in action: Performance prediction of a Cray XT4 system during upgrade	claim
96	105	A resource allocation approach for supporting time-critical applications in grid environments	claim
97	104	Resource-efficient computing paradigm for computational protein modeling applications	claim
98	104	Minimizing total busy time in parallel scheduling with application to optical networks	claim
99	104	RI2N/DRV: Multi-link ethernet for high-bandwidth and fault-tolerant network on PC clusters	claim
100	103	Runtime decision of hardware or software execution on a heterogeneous reconfigurable platform	claim
101	103	Exploring FPGAs for accelerating the phylogenetic likelihood function	claim
102	103	Combining multiple heuristics on discrete resources	claim
103	103	ARMLang: A language and compiler for programming reconfigurable mesh many-cores	claim
104	103	An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability	claim
105	102	Accommodating bursts in distributed stream processing systems	claim
106	102	Resource-aware allocation strategies for divisible loads on large-scale systems	claim
107	102	Ten weeks in the life of an eDonkey server	claim
108	101	Dynamic high-level scripting in parallel applications	claim
109	101	The impact of network noise at large-scale communication performance	claim
110	101	Resource allocation strategies for constructive in-network stream processing	claim
111	100	Generation of Synthetic Floating-Point benchmark circuits	claim
112	100	Measurement of eDonkey activity with distributed honeypots	claim
113	99	Uniform scattering of autonomous mobile robots in a grid	claim
114	98	Efficient and deadlock-free reconfiguration for source routed networks	claim
115	98	New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem	claim
116	98	Folding@home: Lessons from eight years of volunteer distributed computing	claim
117	97	On reducing misspeculations in a pipelined scheduler	claim
118	97	Energy benefits of reconfigurable hardware for use in underwater sensor nets	claim
119	96	The Green500 List: Year one	claim
120	96	High-throughput protein structure determination using grid computing	claim
121	95	Optimizing the execution of a parallel meteorology simulation code	claim
122	95	Taking the heat off transactions: Dynamic selection of pessimistic concurrency control	claim
123	95	Dynamic parallelization for RNA structure comparison	claim
124	93	Phaser accumulators: A new reduction construct for dynamic parallelism	claim
125	92	Scaling communication-intensive applications on BlueGene/P using one-sided communication and overlap	claim
126	91	Improving RDMA-based MPI eager protocol for frequently-used buffers	claim
127	91	Using application communication characteristics to drive dynamic MPI reconfiguration	claim
128	91	Remote-spanners: What to know beyond neighbors	claim
129	91	Performance prediction for running workflows under role-based authorization mechanisms	claim
130	90	Accurate analytical performance model of communications in MPI applications	claim
131	89	Flexible pipelining design for recursive variable expansion	claim
132	88	Self-Stabilizing k-out-of-l exclusion on tree networks	claim
133	88	Designing efficient sorting algorithms for manycore GPUs	claim
134	88	The effect of population density on the performance of a spatial social network algorithm for multi-objective optimisation	claim
135	88	Minimizing startup costs for performance-critical threading	claim
136	88	On scheduling dags to maximize area	claim
137	87	Validating Wrekavoc: A tool for heterogeneity emulation	claim
138	86	A power-aware, application-based performance study of modern commodity cluster interconnection networks	claim
139	86	Peer-to-Peer beyond file sharing: Where are P2P systems going?	claim
140	86	Implementation and analysis of nonblocking collective operations on SCI networks	claim
141	85	An approach for matching communication patterns in parallel applications	claim
142	83	Guiding performance tuning for grid schedules	claim
143	82	Managing the construction and use of Functional Performance Models in a Grid environment	claim
144	82	Revisiting communication performance models for computational clusters	claim
145	81	Sensor network connectivity with multiple directional antennae of a given angular sum	claim
146	78	Implementing protein seed-based comparison algorithm on the SGI RASC-100 platform	claim
147	77	Autonomic management of non-functional concerns in distributed & parallel application programming	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers