Sciweavers

794 search results - page 6 / 159
» Challenges in Parallel Graph Processing
Sort
View
ICPP
2007
IEEE
14 years 3 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
ICPP
2006
IEEE
14 years 2 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...
FTDCS
2003
IEEE
14 years 2 months ago
Autonomous Transaction Processing Using Data Dependency in Mobile Environments
Mobile clients retrieve and update databases at servers. They use transactions in order to ensure the consistency of shared data in the presence of concurrent accesses. Transactio...
IlYoung Chung, Bharat K. Bhargava, Malika Mahoui, ...
IPPS
2006
IEEE
14 years 2 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...