Sciweavers

811 search results - page 29 / 163
» A Comparison of Parallel Programming Models of Network Proce...
Sort
View
JPDC
1998
131views more  JPDC 1998»
13 years 8 months ago
Modeling Free-Space Optical k-ary n-Cube Wormhole Networks
This paper presents an optical interconnect model for k-ary n-cube network topologies based on freespace analysis. This model integrates relevant parameters inherent to optics wit...
Mongkol Raksapatcharawong, Timothy Mark Pinkston
IPPS
2006
IEEE
14 years 2 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
IPPS
2007
IEEE
14 years 2 months ago
Peak-Performance DFA-based String Matching on the Cell Processor
The security of your data and of your network is in the hands of intrusion detection systems, virus scanners and spam filters, which are all critically based on string matching. ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
SC
1995
ACM
14 years 1 days ago
Predicting Application Behavior in Large Scale Shared-memory Multiprocessors
In this paper we present an analytical-based framework for parallel program performance prediction. The main thrust of this work is to provide a means for treating realistic appli...
Karim Harzallah, Kenneth C. Sevcik
IPPS
1998
IEEE
14 years 23 days ago
Efficient Runtime Thread Management for the Nano-Threads Programming Model
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
Dimitrios S. Nikolopoulos, Eleftherios D. Polychro...