No abstract

Abstract. In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce in MANET environment. The problem is to find the ideal forward node set so as to minimize the bandwidth consumed, which is a NP-Complete problem. In this paper we will investigate three dominant node approximation algorithms: dominant pruning, total dominant pruning and partial dominant pruning algorithm. An extension to the original algorithms, modified termination criteria, is proposed. Simulation results show that the new termination criteria ensure the same coverage using a reduced number of forward nodes.

No abstract

To develop a parallel discrete-event simulation from scratch requires in-depth knowledge of the mapping process from the physical model to the simulation model, and also a substantial effort in coping with the numerous issues concerning the underlying synchronization protocols in use. Languages and libraries could reduce the devel opment effort significantly by providing the user with a pre-built parallel simulation kernel as well as application development tools. This pa per contains a survey of the existing languages and libraries for parallel discrete-event simula tion. It is divided into two major sections: one on the languages, the other on the libraries. The discussions are mainly focused on the following aspects: user model, programming framework and language features, library API, protocols, and system support and environment. The re ported performances of some packages are also summarized.

No abstract

ÃTo get high performance on a distributed-memory multicomputer at present and for the foreseeable future, some explicit control is needed. This paper describes work aimed at harnessing the power of the functional notation in exercising such control. We have developed a declarative annotation scheme which allows explicit control over process placement and communications. The language, called Caliban, has been implemented on a con gurable, looselycoupled commercial multicomputer and we describe the compiler and run-time system. Abstract

Abslracf-The ever-increasing demand on container porl throughput has mounted the necessity of a more efficient container storage StNCtUE, the Equirements of which apparently can be met by ASKS because of its abilities of fully automating material handling and the potentials for delivering high performance. In this study, we present an ASKS for container storage, develop the travel time models for the proposed system, and confirm its feasibility in terms of throughput performance. A pre-processing scheme for operation scheduling that significantly improves the AS/RS throughput is proposed and evaluated. Additional constraints arising from the container size and weight on ASiRS design and scheduling are taken into considerations, which in effect leads to a platform-based ASIRS.

No abstract