Sciweavers

2609 search results - page 91 / 522
» Optimizing for parallelism and data locality
Sort
View
100
Voted
CPAIOR
2008
Springer
15 years 2 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
104
Voted
COREGRID
2007
Springer
15 years 6 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
100
Voted
CF
2006
ACM
15 years 6 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
90
Voted
ICASSP
2009
IEEE
14 years 10 months ago
A PARAFAC-based technique for detection and localization of multiple targets in a MIMO radar system
In this paper, we show that the problem of detection and localization of multiple targets in a bistatic MIMO radar system can be solved by Parallel Factor (PARAFAC) analysis. Our ...
Dimitri Nion, Nicholas D. Sidiropoulos
104
Voted
EUROSYS
2010
ACM
15 years 9 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...