Search For:

Displaying 1-10 out of 10 total
On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking
Found in: Parallel and Distributed Processing Symposium, International
By David A. Bader, Virat Agarwal, Kamesh Madduri
Issue Date:March 2007
pp. 76
The Sony-Toshiba-IBM Cell Broadband Engine is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE), with eight SIMD co-processing units (SPEs) integrated on-chip. We present a complexity model for designing algorithms ...
 
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Found in: Parallel Processing, International Conference on
By David A. Bader, Aparna Chandramowlishwaran, Virat Agarwal
Issue Date:September 2008
pp. 520-527
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimize several parallel pseudo random number generators on the Cell Broadband Engin...
 
Financial modeling on the cell broadband engine
Found in: Parallel and Distributed Processing Symposium, International
By Virat Agarwal, Lurng-Kuo Liu, David A. Bader
Issue Date:April 2008
pp. 1-12
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In this paper we investigate the performance of financial workloads on the Sony-Tos...
 
Intra-Socket and Inter-Socket Communication in Multi-core Systems
Found in: IEEE Computer Architecture Letters
By Fabrizio Petrini, Virat Agarwal, Davide Pasetto
Issue Date:January 2010
pp. 13-16
The increasing computational and communication demands of the scientific and industrial communities require a clear understanding of the performance trade-offs involved in multi-core computing platforms. Such analysis can help application and toolkit devel...
 
Streaming, low-latency communication in on-line trading systems
Found in: Parallel and Distributed Processing Workshops and PhD Forum, 2011 IEEE International Symposium on
By Hari Subramoni,Fabrizio Petrini,Virat Agarwal,Davide Pasetto
Issue Date:April 2010
pp. 1-8
This paper presents and evaluates the performance of a prototype of an on-line OPRA data feed decoder. Our work demonstrates that, by using best-in-class commodity hardware, algorithmic innovations and careful design, it is possible to obtain the performan...
 
Tools for Very Fast Regular Expression Matching
Found in: Computer
By Davide Pasetto, Fabrizio Petrini, Virat Agarwal
Issue Date:March 2010
pp. 50-58
No summary available.
 
SCAMPI: a scalable CAM-based algorithm for multiple pattern inspection
Found in: SC Conference
By Fabrizio Petrini, Virat Agarwal, Davide Pasetto
Issue Date:November 2009
pp. 1-11
String matching is one of the most compute intensive steps in a network intrusion detection system. The growing network rates, rapidly approaching 10 Gbits/sec, and the large number of signatures that need to be scanned concurrently pose very demanding cha...
 
Fulcrum's FocalPoint FM4000: A Scalable, Low-Latency 10GigE Switch for High-Performance Data Centers
Found in: High-Performance Interconnects, Symposium on
By Uri Cummings, Dan Daly, Rebecca Collins, Virat Agarwal, Fabrizio Petrini, Michael Perrone, Davide Pasetto
Issue Date:August 2009
pp. 42-51
The convergence of different types of networks into a common data center infrastructure poses a superset challenge on the part of the underlying component technology. IP networks are feature-rich, storage networks are lossless with controlled topologies, a...
 
Scalable Graph Exploration on Multicore Processors
Found in: SC Conference
By Virat Agarwal, Fabrizio Petrini, Davide Pasetto, David A. Bader
Issue Date:November 2010
pp. 1-11
Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large...
 
SCAMPI: a scalable CAM-based algorithm for multiple pattern inspection
Found in: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC '09)
By Davide Pasetto, Fabrizio Petrini, Virat Agarwal
Issue Date:November 2009
pp. 1-11
String matching is one of the most compute intensive steps in a network intrusion detection system. The growing network rates, rapidly approaching 10 Gbits/sec, and the large number of signatures that need to be scanned concurrently pose very demanding cha...
     
 1