Sciweavers

7092 search results - page 1206 / 1419
» Parallelizing constraint programs
Sort
View
HPDC
2010
IEEE
13 years 9 months ago
Scalability of communicators and groups in MPI
As the number of cores inside compute clusters continues to grow, the scalability of MPI (Message Passing Interface) is important to ensure that programs can continue to execute o...
Humaira Kamal, Seyed M. Mirtaheri, Alan Wagner
ASPLOS
2010
ACM
13 years 7 months ago
Best-effort semantic document search on GPUs
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Sr...
CCGRID
2011
IEEE
12 years 12 months ago
Network-Friendly One-Sided Communication through Multinode Cooperation on Petascale Cray XT5 Systems
—One-sided communication is important to enable asynchronous communication and data movement for Global Address Space (GAS) programming models. Such communication is typically re...
Xinyu Que, Weikuan Yu, Vinod Tipparaju, Jeffrey S....
PLDI
2011
ACM
12 years 11 months ago
Automated atomicity-violation fixing
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
Guoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben...
PPOPP
2012
ACM
12 years 3 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
« Prev « First page 1206 / 1419 Last » Next »