Sciweavers

6138 search results - page 372 / 1228
» High performance computing through parallel processing
Sort
View
PPOPP
2012
ACM
14 years 13 days ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICDCS
2010
IEEE
15 years 8 months ago
A Spinning Join That Does Not Get Dizzy
— As network infrastructures with 10 Gb/s bandwidth and beyond have become pervasive and as cost advantages of large commodity-machine clusters continue to increase, research and...
Philip Werner Frey, Romulo Goncalves, Martin L. Ke...
ICWS
2009
IEEE
16 years 2 months ago
Deactivation of Unwelcomed Deep Web Extraction Services through Random Injection
Websites serve content both through Web Services as well as through user-viewable webpages. While the consumers of web-services are typically ‘machines’, webpages are meant fo...
Varun Bhagwan, Tyrone Grandison
ACSAC
2004
IEEE
15 years 8 months ago
Correlating Intrusion Events and Building Attack Scenarios Through Attack Graph Distances
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
Steven Noel, Eric Robertson, Sushil Jajodia
188
Voted
IPPS
1997
IEEE
15 years 9 months ago
DPF: A Data Parallel Fortran Benchmark Suite
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehag...