Search results

In the current competitive environment, each company faces a number of challenges: quick response to customers’ demands, high quality of products or services, customers’ satisfaction, reliable delivery dates, high efficiency, and others. As a result, during the last five years many firms have proceeded to the adoption of enterprise resource planning (ERP) solutions. ERP is a packaged software system, which enables the integration of operations, business processes and functions, through common data‐processing and communications protocols. However, the majority, if not all, of these systems do not support the production scheduling process that is of crucial importance in today’s manufacturing and service industries. In this paper, the authors propose a knowledge‐based system for production‐scheduling that could be incorporated as a custom module in an ERP system. This system uses the prevailing conditions in the industrial environment in order to select dynamically and propose the most appropriate scheduling algorithm from a library of many candidate algorithms.

This is the first part of a two-part paper. The purpose of this paper is to report on methods that use the Response Surface Methodology (RSM) to investigate an Evolutionary Algorithm (EA) and memory-based approach referred to as McBAR – the Mapping of Task IDs for Centroid-Based Adaptation with Random Immigrants. Some of the methods are useful for investigating the performance (solution-search abilities) of techniques (comprised of McBAR and other selected EA-based techniques) for solving some multi-objective dynamic resource-constrained project scheduling problems with time-varying number of tasks.

The RSM is applied to: determine some EA parameters of the techniques, develop models of the performance of each technique, legitimize some algorithmic components of McBAR, manifest the relative performance of McBAR over the other techniques and determine the resiliency of McBAR against changes in the environment.

The results of applying the methods are explored in the second part of this work.

The models are composite and characterize an EA memory-based technique. Further, the resiliency of techniques is determined by applying Lagrange optimization that involves the models.

With the availability of powerful personal computers (PCs), workstations and networking devices, the recent trend in parallel computing is to connect a number of individual workstations (PC and PC symmetric multiprocessor systems (SMP)) to solve computation‐intensive tasks in parallel way on such clusters (networks of workstations (NOW), SMP and Grid). In this sense, it is not more true to consider traditionally evolved parallel computing and distributed computing as two separate research disciplines. Current trends in high performance computing are to use NOW (and SMP) as a cheaper alternative to traditionally used massively parallel multiprocessors or supercomputers and to profit from unifying of both mentioned disciplines. The purpose of this paper is to consider the individual workstations could be so single PC as parallel computers based on modern SMP implemented within workstation.

Such parallel systems (NOW and SMP), are connected through widely used communication standard networks and co‐operate to solve one large problem. Each workstation is threatened similarly to a processing element as in a conventional multiprocessor system. But, personal processors or multiprocessors as workstations are far more powerful and flexible than the processing elements in conventional multiprocessors. To make the whole system appear to the applications as a single parallel computing engine (a virtual parallel system), run‐time environments such as OpenMP, Java (SMP), message passing interface, Java (NOW) are used to provide an extra layer of abstraction.

To exploit the parallel processing capability of such cluster, the application program must be paralleled. The effective way how to do it for (parallelisation strategy) belongs to a most important step in developing effective parallel algorithm (optimisation). To behaviour analysis, all overheads that have the influence to performance of parallel algorithms (architecture, computation, communication, etc.) have to be taken into account. In this paper, such complex performance evaluation of iterative parallel algorithms (IPA) and their practical implementations are discussed (Jacobi and Gauss‐Seidel iteration). On real application example, the various influences in process of modelling and performance evaluation and the consequences of their distributed parallel implementations are demonstrated.

The paper usefully shows that better load balancing can be achieved among used network nodes (performance optimisation of parallel algorithm). Generally, it claims that the parallel algorithms or their parts (processes) with more communication (similar to analyzed Gauss‐Seidel parallel algorithm) will have better speed‐up values using modern SMP parallel system as its parallel implementation in NOW. For the algorithms or processes with small communication overheads (similar to analysed Jacobi parallel algorithm) the other network nodes can be used based on single processors.

Applies a parallel backward‐chaining technique to a rule‐based expert system on a shared‐memory multiprocessor system. The condition for a processor to split up its search tree (task‐node) and generate new OR nodes is based on the level in the goal tree at which the task‐node is found. The results indicate satisfactory speed‐up performance for a small number of processors (< 10) and a reasonably large number of rules.

THE DESIGN, DEVELOPMENT AND PRODUCTION of the hardware of the UNIVAC® 1832 (US Navy designation AN/UYK‐10) multiprocessor computer is the responsibility of Sperry Univac's defence systems division and also has responsibility for the software and software integration.

This paper describes the simulation of a nearest neighbour searching algorithm for document retrieval using a pool of microprocessors. The documents in a database are organised in a multi‐dimensional binary search tree, and the algorithm identifies the nearest neighbour for a query by a backtracking search of this tree. Three techniques are described which allow parallel searching of the tree. A PASCAL‐based, general purpose simulation system is used to simulate these techniques, using a pool of Transputer‐like microprocessors with three standard document test collections. The degree of speed‐up and processor utilisation obtained is shown to be strongly dependent upon the characteristics of the documents and queries used. The results support the use of pooled microprocessor systems for searching applications in information retrieval.

The purpose of this paper is to describe a novel diagnosis approach, using neural networks (NNs), which can be used to identify faulty nodes in distributed and multiprocessor systems.

Based on a literature‐based study focusing on research methodology and theoretical frameworks, the conduct of an ethnographic case study is described in detail. A discussion of the reporting and analysis of the data is also included.

This work shows that NNs can be used to implement a more efficient and adaptable approach for diagnosing faulty nodes in distributed systems. Simulations results indicate that the perceptron‐based diagnosis is a viable addition to present diagnosis problems.

This paper presents a solution for the asymmetric comparison model. For a more generalized approach that can be used for other comparison or invalidation models this approach requires a multilayer neural network.

The extensive simulations conducted clearly showed that the perceptron‐based diagnosis algorithm correctly identified all the millions of faulty situations tested. In addition, the perceptron‐based diagnosis requires an off‐line learning phase which does not have an impact on the diagnosis latency. This means that a fault set can be easily and rapidly identified. Simulations results showed that only few milliseconds are required to diagnose a system, hence, one can start talking about “real‐time” diagnosis.

The paper is first work that uses NNs to solve the system‐level diagnosis problem.

Computational algorithms for finite element dynamic analysis of large‐scale structural problems that exploit both concurrent and parallel features of multiple instruction multiple data streams computers are presented. A new computer program architecture is used in which large finite element domains are automatically divided into subdomains. The number of subdomains generated is equal to the number of available processors. The spatial solution is obtained using a basis of orthogonal vectors. The temporal solution is computed exactly. Discussion is focused on the concurrent generation of global Ritz vectors. Examples run on a hypercube multiprocessor confirm the potential of the proposed scheme.

Inverse problems deal with determining the causes on the basis of knowing their effects. The object of the inverse parameter estimation problem is to fix the thermal material parameters (the cause) on the strength of a given observation of the temperature history at one or more interior points (the effect). This paper demonstrates two novel approaches to the inverse problems. These approaches use two artificial intelligence mechanisms: neural network and genetic algorithm. Examples shown in this paper give a comparison of results obtained by both of these methods. The numerical technique of neural networks evolved from the effort to model the function of the human brain and the genetic algorithms model the evolutional process of nature. Both of the presented approaches can lead to a solution without having problems with the stability of the inverse task. Both methods are suitable for parallel processing and are advantageous for a multiprocessor computer architecture.