Sciweavers

416 search results - page 68 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
114
Voted
IPPS
2009
IEEE
15 years 5 months ago
Singular value decomposition on GPU using CUDA
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
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 11 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
ICDCS
2006
IEEE
15 years 5 months ago
Dynamic Access Control in a Content-based Publish/Subscribe System with Delivery Guarantees
Content-based publish/subscribe (pub/sub) is a promising paradigm for building asynchronous distributed applications. In many application scenarios, these systems are required to ...
Yuanyuan Zhao, Daniel C. Sturman
FTDCS
2003
IEEE
15 years 4 months ago
On-Demand Media Streaming Over the Internet
We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overa...
Mohamed Hefeeda, Bharat K. Bhargava
HPDC
1998
IEEE
15 years 3 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon