Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. Here we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances irrespective of the size of meshes and distribution of the shape of the incoming tasks.

(2) All-to-All Communication in Wireless Ad Hoc Networks

Abstract

All-to-all communication pattern can be found in conferences/meetings in wireless ad hoc networks. People today attend meetings and conferences with their laptops, palmtops, and notebooks. It is, therefore, attractive to have instant network formation, in addition to file and information sharing without the presence of fixed base stations and systems administrators. We are developing algorithms for all-to-all communication in wireless ad hoc networks. Computer simulation is being done using the simulator implemented within the Global Mobile Simulation (GloMoSim).

 

 

About the Speaker

Seong-Moo Yoo received the BA degree in economics from Seoul National University, Seoul, Korea, and the MS and PhD degrees in computer science from The University of Texas at Arlington in 1989 and 1995, respectively. He is currently an Assistant Professor in the Department of Computer Science, Columbus State University, Columbus, Georgia.  His research interests include parallel computing, mobile computing, and computer security.  Dr. Yoo is a member of ACM and IEEE Computer Society and Communication Society.