Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

Syracuse University

Communication

Articles 1 - 4 of 4

Full-Text Articles in Entire DC Network

Sensor Communication Networks Using Swarming Intelligence, Rajani Muraleedharan, Lisa Ann Osadciw Jan 2003

Sensor Communication Networks Using Swarming Intelligence, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

Energy consumption is currently a key issue in research for future sensor networks. This paper presents a novel approach to sensor network routing based on energy consumption. The unique routing algorithm uses swarm intelligence, which is computationally efficient.


A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam Jan 1998

A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam

Electrical Engineering and Computer Science - All Scholarship

Reducing communication overhead is extremely important in distributed-memory message-passing architectures. In this paper, we present a technique to improve communication that considers data access patterns of the entire program. Our approach is based on a combination of traditional data-flow analysis and a linear algebra framework, and works on structured programs with conditional statements and nested loops but without arbitrary goto statements. The distinctive features of the solution are the accuracy in keeping communication set information, support for general alignments and distributions including block-cyclic distributions and the ability to simulate some of the previous approaches with suitable modifications. We also show …


Benchmarking The Computation And Communication Performance Of The Cm-5, Kivanc Dincer, Zeki Bozkus, Sanjay Ranka, Geoffrey C. Fox Jan 1996

Benchmarking The Computation And Communication Performance Of The Cm-5, Kivanc Dincer, Zeki Bozkus, Sanjay Ranka, Geoffrey C. Fox

Northeast Parallel Architecture Center

Thinking Machines' CM-5 machine is a distributed-memory, message-passing computer. In this paper we devise a performance benchmark for the base and vector units and the data communication networks of the CM-5 machine. We model the communication characteristics such as communication latency and bandwidths of point-to-point and global communication primitives. We show, on a simple Gaussian elimination code, that an accurate static performance estimation of parallel algorithms is possible by using those basic machine properties connected with computation, vectorization, communication, and synchronization. Furthermore, we describe the embedding of meshes or hypercubes on the CM-5 fat-tree topology and illustrate the performance results …


Software Issues And Performance Of A Parallel Model For Stock Option Pricing, Kim Mills, Gang Cheng, Michael Vinson, Sanjay Ranka Jan 1992

Software Issues And Performance Of A Parallel Model For Stock Option Pricing, Kim Mills, Gang Cheng, Michael Vinson, Sanjay Ranka

Northeast Parallel Architecture Center

The finance industry is beginning to adopt parallel computing for numerical computation, and will soon be in a position to use parallel supercomputers. This paper examines software issues and performance of a stock option pricing model running on the Connection Machine-2 and DECmpp-12000. Pricing models incorporating stochastic volatility with American call (early exercise) are computationally intensive and require substantial communication. Three parallel versions of a stock option pricing model were developed which varied in data distribution, load balancing, and communication. The performance of this set of increasingly refined models ranged over no improvement, 10 times, and 100 times faster than …