R. Jullien, Robert Botet, Paulo Machado Mors · Faraday Discussions of the Chemical Society · 1987
We briefly introduce a simple extension of the diffusion-limited aggregation model of Witten and Sander, the cluster-cluster aggregation model, in which all clusters diffuse and grow by sticking at their first contact. This model is particularly well adapted to describe aggregation experiments on colloids or aerosols. Three recent extensions of the model are emphasized which take into account possible restructuring, cluster polarizability or indirect aggregation by polymers. In these three cases the computer simulations are compared with experiment.
Cited by 77
Стоянка Моллова, Хрусав Хрусафов, Калоян Тотев · Bulgarian Portal for Open Science · 2019
In this paper is present PC based computer cluster. The steps of hardware and software platform realization are described.
Cited by 0Open access
Aridhatullah · Electronic theses and dissertations (Syiah Kuala University) · 2015
This final project discusses about how to create a cluster computer by usingMPICH2 then be analyzed the speed ratio between the computing performancecomputer cluster and non cluster. The purpose of writing of this project is tocreate five PCs which are connected into network and will form a clustercomputer by using MPICH2. Later, the performance of computing MPICH2 incluster computer will be analyzed. The phase on creating this cluster computerwill be started with designed topology which is used, doing the installation andconfiguration of MPICH2 to the five PCs, then will perform computational testing by performing matrix multiplication as well as collecting data from its comparison. These computers accelerate computing performance and shorten thetime of wide scale of calculation.Key words :cluster, MPICH2, matrix
Cited by 0
F. Duque, Á. Mañanes, L. M. Molina et al. · International Journal of Quantum Chemistry · 2001
Abstract Density functional theory is used to investigate the assembling of metallic clusters to yield stable or metastable cluster solids. Motivated by the observed high stability of the Al 13 H cluster, which has a substantial highest occupied and lowest unoccupied molecular orbitals (HOMO–LUMO) gap, we have modeled the assembling of those clusters. For a favorable relative orientation of each cluster with respect to all its neighbors, a cluster solid is predicted and its structure appears to be stable at least up to 150 K, which is the highest temperature in our simulations. We have also studied the chemical bonding in the stoichiometric solid alloys PbA, where A is one of the alkali elements Na, K, Rb, or Cs. Those crystals exist in an ordered phase formed by tetrahedral Pb 4 clusters surrounded by the alkali atoms. The study of this family of natural cluster compounds reveals the coating role played by the cations, providing further insight into the favorable conditions required for the formation of cluster solids. © 2001 John Wiley & Sons, Inc. Int J Quantum Chem, 2001
Cited by 20
Ronan Perry · Defense Technical Information Center (DTIC) · 1983
Cited by 1
Igor Grudenić, Nikola Bogunović · 2009
Abstract – Evaluation of scheduling algorithms for distributed environments is a complex task that involves simulation of computation resources, interconnection network, users and generated workload. Multiple discrete event based simulators are developed that tackle different aspects of distributed systems in order to ease that task. In this paper we address the simulation of computer clusters that are the most popular distributed system architecture. Fundamentals of the available simulators are given and the extendable architecture for the new simulator is proposed. Three-phase discrete event simulation is recognized as the simulation technique of choice, and the behavior of the key components is modeled using that technique. Implementation details targeted to object oriented environments are pointed out.
Cited by 3
M. B. J. Harrison · 1998
Cited by 0
Robert G. Brown · 2000
reserved. No republication of this document in any form whatsoever is permitted without the written permission of the author. NOTE WELL: This book is in a pretty much perpetual state of being written and rewritten. This is inevitable { technology changes rapidly, I'm busy, I write and then rewrite, add and take away. So you're about to look at a snapshot that could be dierent tomorrow. Not greatly dierent, but dierent. So look at the date: May 24, 2004, and check back accordingly. Note also that the author is not to be held legally responsible for the accuracy of the content of this book. Read the Open Publication License at the end if you have any doubts or questions about what you can and cannot do (can print and use for own purposes or distribution at the cost of media, cannot reprint and sell for a prot without my permission, and getting my permission will likely
Cited by 0
Lokanathan Vanchinathan Sree Bagvath · DR-NTU (Nanyang Technological University) · 2021
Since tasks are becoming more computationally intensive, the demand for parallel programming or cluster computing increases as it does not reduce the computational time. However, the tools and equipment required for cluster computing are expensive and is not readily accessible to those in the academic environment such as students. With the advent of low-cost embedded platforms like Raspberry Pi and Jetson Nano, it is convenient for students to build a computer cluster based on embedded platforms. This enables them to have hands-on experience and learn the fundamentals of cluster computing. In this paper, a cluster computer is built with Jetson Nanos and the performance of the cluster is analysed when running a computationally intensive application in the CPU as well as in the GPU. The number of nodes in the cluster is varied and the results obtained are presented in this paper.
Cited by 0
Hong Lin, Jeremy Kemp, Padraic Gilbert · International Journal of Technology Diffusion · 2010
Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.
Cited by 12
E. Backer · Medical Entomology and Zoology · 1995
RECONNAISANCE OF THE DOMAIN. Cluster Analysis: Why, What, How, When. Methods in Clustering Data. Examples and Discussion. Framing of Cluster Analysis Studies. Fuzzy Clustering: A Branch in Fuzzy Logic. RECONSIDERATION OF THE TASK. Indetermination and Uncertainty in Cluster Analysis. The Need and Relevance of Computer-assisted Reasoning in Cluster Analysis. COMPUTER-ASSISTED DECISION SUPPORT IN CLUSTER ANALYSIS. Knowledge-based Expert Systems: An Introduction. Rule Base Developments for Cluster Analysis. Case Study: Analysis of Delphind Sonar Sound Signals.
Cited by 116
Hong Lin, Jeremy Kemp, Padraic Gilbert · IGI Global eBooks · 2012
Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.
Cited by 0
Landau, K · CERN Document Server (European Organization for Nuclear Research) · 1976
An introduction to computer workload analysis is given, showing its range of application in computer centre management, system and application programming. Cluster methods are discussed which can be used in conjunction with workload data and cluster algorithms are adapted to the specific set problem. Several samples of CDC 7600- accounting-data-collected at CERN, the European Organization for Nuclear Research-underwent a cluster analysis to determine job groups. The conclusions from resource usage of typical job groups in relation to computer workload analysis are discussed. (17 refs).
Cited by 1
Hong Lin, Jeremy Kemp, Padraic Gilbert · Advances in knowledge acquisition, transfer, and management book series/Advances in knowledge acquisition, transfer and management book series · 2012
Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.
Cited by 0
Edward A. Patrick, F.P. Fischer · IEEE Transactions on Computers · 1969
The unsupervised estimation problem has been conveniently formulated in terms of a mixture density. It has been shown that a criterion naturally arises whose maximum defines the Bayes minimum risk solution. This criterion is the expected value of the natural log of the mixture density. By making the assumptions that the component densities in the mixture are truncated Gaussian, the criterion has a greatly simplified form. This criterion can be used to resolve mixtures when the number of classes as well as the class covariances are unknown. In this paper a technique is presented where an assumed test covariance is supplied by an experimenter who uses a test function as a "portable magnifying glass" to examine data. Because the experimenter supplies the covariance and thus the test function, the technique is especially suited for interactive data analysis.
Cited by 17
M. J. Shepherd · The Computer Journal · 1968
This paper discusses the programming implementation of Sneath's Single Link Taxometric Analysis for the Atlas 1 computer and the modification of this method which the authors have developed to overcome any chaining that occurs between otherwise well separated clusters. Two distinct algorithms are presented for Single Link Analysis.
Cited by 12Open access
Y. Yamamura · Shinku · 1992
Cited by 0Open access
University of Maine · DigitalCommons (California Polytechnic State University) · 1984
A photograph of several students using early computer terminals in Fogler Library in 1984. The circulation desk runs along the building's south wall in the background. This image was included in the book Becoming Modern: The University of Maine, 1965-2015, with the caption, "Fogler Library addition interior, 1984." Digitized from the University Photograph Archive - Buildings - Fogler Library - Addition.
Cited by 0
Rasmussen, E.M., Willet, P, British Library, London (United Kingdom) et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1988
Cited by 1Open access
M.A. Torres, Rayford B. Vaughn, German Florez et al. · 2003
Abstract – This paper describes several scenarios that could potentially be used to implement attacks against a Linux high performance cluster, resulting in actions that corrupt information in the system (i.e. integrity issues), collect important information (i.e. confidentiality violations), and perform denial of service attacks (i.e. availability issues). These attacks were designed and tested for the MPI/PRO and C environments. We have implemented anomaly detection algorithms which are able to verify the correct execution of parallel programs. We also report representative results of our detection efforts that provide evidence of success. Technical level 4. Attacking a High Performance Computer Cluster
Cited by 4