Sciweavers

17541 search results - page 64 / 3509
» Complexity in scalable computing
Sort
View
JPDC
2008
129views more  JPDC 2008»
14 years 9 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
INFOCOM
2010
IEEE
14 years 8 months ago
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
—Cloud computing is an emerging computing paradigm in which resources of the computing infrastructure are provided as services over the Internet. As promising as it is, this para...
Shucheng Yu, Cong Wang, Kui Ren, Wenjing Lou
CASES
2006
ACM
15 years 3 months ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...
CIKM
2011
Springer
13 years 9 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang