The proceedings contain 23 papers. The special focus in this conference is on Neural Networks. The topics include: Preface;when are k-nearest neighbor and back propagation accurate for feasible sized sets of examples?...
ISBN:
(纸本)9783540522553
The proceedings contain 23 papers. The special focus in this conference is on Neural Networks. The topics include: Preface;when are k-nearest neighbor and back propagation accurate for feasible sized sets of examples?;rule-injection hints as a means of improving network performance and learning time;inversion in time;cellular neural networks: Dynamic properties and adaptive learning algorithm;improved simulated annealing, Boltzmann machine, and attributed graph matching;artificial dendritic learning;a neural net model of human short-term memory development;large vocabulary speech recognition using neural-fuzzy and concept networks;speech feature extraction using neural networks;neural network based continuous speech recognition by combining self organizing feature maps and hidden markov modeling;ultra-small implementation of a neural halftoning technique;complexity theory of neural networks and classification problems;application of self-organising networks to signal processing;a study of neural network applications to signal processing;simulation machine and integrated implementation of neural networks: A review of methods, problems and realizations;vLSI implementation of an associative memory based on distributed storage of information;generalization performance of overtrained back-propagation networks;stability of the random neural network model;temporal pattern recognition using EBPS;markovian spatial properties of a random field describing a stochastic neural network: Sequential or parallel implementation?;chaos in neural networks;the "moving targets" training algorithm;acceleration techniques for the backpropagation algorithm.
In a distributedsimulation, simulation components of various types are executed at geographically different locations, forming a simulation federation to create a common virtual environment. Under the High Level Arch...
详细信息
ISBN:
(纸本)076951104X
In a distributedsimulation, simulation components of various types are executed at geographically different locations, forming a simulation federation to create a common virtual environment. Under the High Level Architecture (HLA), information that will be produced and consumed by a simulation component is defined in its object model, and how that information is produced and consumed is well encapsulated inside the simulation component's implementation. However in the current implementation of the HLA's Runtime Infrastructure (RTI), information hiding between groups of simulation components in a simulation federation is not addressed. The authors discuss how hierarchical federation architectures can be used to tackle this problem. The hierarchical federation architecture adopted in the paper differs from the existing architectures in that it is based on a hybrid approach for interoperability between simulation federations. To demonstrate information hiding using the architecture, a distributed semiconductor supply-chain simulation is also described.
A new Conservative algorithm for both parallel and sequential simulation of networks is described. The technique is motivated by the construction of a high performance simulator for ATM networks. It permits very fast ...
详细信息
ISBN:
(纸本)9780818675393
A new Conservative algorithm for both parallel and sequential simulation of networks is described. The technique is motivated by the construction of a high performance simulator for ATM networks. It permits very fast execution of models of ATM systems, both sequentially and in parallel. A simple analysis of the performance of the system is made. Initial performance results from parallel and sequential implementations are presented and compared with comparable results from an optimistic TimeWarp based simulator. It is shown that the conservative simulator performs well when the "density" of messages in the simulated system is high, a condition which is likely to hold in many interesting ATM scenarios.
The WK-recursive networks are highly concurrent message-passing architectures which belong to a class of regular scalable topologies and can be expanded very easily to any size regardless of the node degree. The autho...
详细信息
The WK-recursive networks are highly concurrent message-passing architectures which belong to a class of regular scalable topologies and can be expanded very easily to any size regardless of the node degree. The authors examine the strength and weakness of WK-recursive topologies from a graph point of view and consider the features that make its connectivity appealing. A set of interconnection metrics is defined. A simulation package is developed and a transputer development system (TDS) is used to evaluate the relation between communication time, size of message, and distance traveled.< >
The simulation of wide area computer networks is one area where the benefits of parallelsimulation have been clearly demonstrated. Here we present a description of a system that uses a parallel discrete event simulat...
详细信息
ISBN:
(纸本)9780769506678
The simulation of wide area computer networks is one area where the benefits of parallelsimulation have been clearly demonstrated. Here we present a description of a system that uses a parallel discrete event simulator to act as a high speed network emulator. With this, real Internet Protocol (IP) traffic generated by application programs running on user workstations can interact with modelled traffic in the emulator, thus providing a controlled test environment for distributed *** network emulator uses the TasKit conservative parallel discrete event simulation (PDES) kernel. TasKit has been shown to be able to achieve improved parallel performance over existing conservative and optimistic PDES kernels, as well as improved sequential performance over an existing central-event-list based kernel. This paper explains the modifications that have been made to TasKit to enable real-time operation along with the emulator interface that allows the IP network simulation running in the TasKit kernel to interact with real IP clients. Initial emulator performance data is included.
This paper examines memory management issues associated with Time Warp synchronized parallelsimulation on distributed memory machines. The paper begins with a summary of the techniques which have been previously prop...
详细信息
ISBN:
(纸本)9780818671203
This paper examines memory management issues associated with Time Warp synchronized parallelsimulation on distributed memory machines. The paper begins with a summary of the techniques which have been previously proposed for memory management on various parallel processor memory structures. It then concentrates the discussion on parallelsimulation executing on a distributed memory computer—a system comprised of separate computers, interconnected by a communications network. An important characteristic of the software developed for such systems is the fact that the dynamic memory is allocated from a pool of memory that is shared by all of the processes at a given *** paper presents a new memory management protocol, pruneback, which recovers space by discarding previous states. This is different from all previous schemes such as artificial rollback and cancelback which recover memory space by causing one or more logical processes to roll back to an earlier simulation *** paper includes an empirical study of a parallelsimulation of a closed stochastic queueing network showing the relationship between simulation execution time and amount of memory available. The results indicate that using pruneback is significantly more effective than artificial rollback (adapted for a distributed memory computer) for this problem. In the study, varying the memory limits over a 2:1 range resulted in a 1:2 change in artificial rollback execution time and almost no change in pruneback execution time.
The major goal of this work has been to develop an implementation of a parallel partitioning algorithm which is suitable for use in a conservatively synchronized parallel Discrete Event simulation (PDES) environment. ...
ISBN:
(纸本)9781565550551
The major goal of this work has been to develop an implementation of a parallel partitioning algorithm which is suitable for use in a conservatively synchronized parallel Discrete Event simulation (PDES) environment. Effective partitioning is essential for performance and capacity consideration, for any PDES problem. The performance of the partitioning algorithm is very important, to the overall simulation performance. There are two possible approaches to improve performance for the partitioning step: algorithm modifications; and parallelize the partitioning algorithm (Fiduccia and Mattheyses, 1982) is developed. The basic algorithm has been modified, first for parallel execution with a similar quality of final partition; and then further modified to increase the parallelism of the algorithm, at the expense of partition quality.
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of ...
详细信息
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of parallel applications on distributed systems has been hampered by the high communication overhead. To reduce the communication overhead and the completion time of a parallel application, we propose a key message model for parallel computing on network of workstations (NOWs). In the key message model, all messages generated in a key message path are prioritized. A key message path in a task graph is defined as the path that is optimized by the key message algorithm. All messages generated in a key message path are prioritized. Besides, the key message algorithm automatically finds the key message paths. In this paper, we first describe the algorithm that identifies the key messages to be prioritized in a parallel application, then analyze the cost of the algorithm, and finally evaluate the performance of the algorithm in a simulation. Our preliminary analysis of the algorithm shows improvement over the system which does not use prioritization scheme.
暂无评论