Sciweavers

1205 search results - page 159 / 241
» On P Systems with Bounded Parallelism
Sort
View
ICDCN
2011
Springer
14 years 9 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
FCCM
2006
IEEE
107views VLSI» more  FCCM 2006»
16 years 4 days ago
Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths
Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...
Uday Bondhugula, Ananth Devulapalli, James Dinan, ...
133
Voted
IPPS
2006
IEEE
16 years 3 days ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller
ICPPW
2009
IEEE
16 years 22 days ago
CkDirect: Unsynchronized One-Sided Communication in a Message-Driven Paradigm
A significant fraction of parallel scientific codes are iterative with barriers between iterations or even between phases of the same iteration. The sender of a message is assur...
Eric J. Bohm, Sayantan Chakravorty, Pritish Jetley...
BIOINFORMATICS
2012
13 years 8 months ago
SSuMMo: rapid analysis, comparison and visualization of microbial communities
Motivation: Next-generation sequencing methods are generating increasingly massive datasets, yet still do not fully capture genetic diversity in the richest environments. To under...
Alex L. B. Leach, James P. J. Chong, Kelly R. Rede...