210 research outputs found
Recommended from our members
On resource placements and fault-tolerant broadcasting in toroidal networks
Parallel computers are classified into: Multiprocessors, and multicomputers. A multiprocessor system usually has a shared memory through which its processors can communicate. On the other hand, the processors of a multicomputer system communicate by message passing through an interconnection network. A widely used class of interconnection networks is the toroidal networks. Compared to a hypercube, a torus has a larger diameter, but better tradeoffs, such as higher channel bandwidth and lower node degree. Results on resource placements and fault-tolerant broadcasting in toroidal networks are presented. Given a limited number of resources, it is desirable to distribute these resources over the interconnection network so that the distance between a non-resource and a closest resource is minimized. This problem is known as distance-d placement. In such a placement, each non-resource must be within a distance of d or less from at least one resource, where the number of resources used is the least possible. Solutions for distance-d placements in 2D and 3D tori are proposed. These solutions are compared with placements used so far in practice. Simulation experiments show that the proposed solutions are superior to the placements used in practice in terms of reducing average network latency. The complexity of a multicomputer increases the chances of having processor failures. Therefore, designing fault-tolerant communication algorithms is quite necessary for a sufficient utilization of such a system. Broadcasting (single-node one-to-all) in a multicomputer is one of the important communication primitives. A non-redundant fault-tolerant broadcasting algorithm in a faulty toroidal network is designed. The algorithm can adapt up to (2n-2) processor failures. Compared to the optimal algorithm in a fault-free n-dimensional toroidal network, the proposed algorithm requires at most 3 extra communication steps using cut through packet routing, and (n + 1) extra steps using store-and-forward routing
Recommended from our members
Resource placement, data rearrangement, and Hamiltonian cycles in torus networks
Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is becoming a popular topology for the interconnection network of a high performance parallel computers.
In a multicomputer, the resources, such as I/O devices or software packages, are distributed over the networks. The first part of the thesis investigates efficient methods of distributing resources in a torus network. Three classes of placement methods are studied. They are (1) distant-t placement problem: in this case, any non-resource node is at a distance of at most t from some resource nodes, (2) j-adjacency problem: here, a non-resource node is adjacent to at least j resource nodes, and (3) generalized placement problem: a non-resource node must be a distance of at most t from at least j resource nodes.
This resource placement technique can be applied to allocating spare processors to provide fault-tolerance in the case of the processor failures. Some efficient
spare processor placement methods and reconfiguration schemes in the case of processor failures are also described.
In a torus based parallel system, some algorithms give best performance if the data are distributed to processors numbered in Cartesian order; in some other cases, it is better to distribute the data to processors numbered in Gray code order. Since the placement patterns may be changed dynamically, it is essential to find efficient methods of rearranging the data from Gray code order to Cartesian order and vice versa. In the second part of the thesis, some efficient methods for data transfer from Cartesian order to radix order and vice versa are developed.
The last part of the thesis gives results on generating edge disjoint Hamiltonian cycles in k-ary n-cubes, hypercubes, and 2D tori. These edge disjoint cycles are quite useful for many communication algorithms
Optimal Interleaving on Tori
We study t-interleaving on two-dimensional tori, which is defined by the property that any connected subgraph with t or fewer vertices in the torus is labelled by all distinct integers. It has applications in distributed data storage and burst error correction, and is closely related to Lee metric codes. We say that a torus can be perfectly t-interleaved if its t-interleaving number – the minimum number of distinct integers needed to t-interleave the torus – meets the spherepacking lower bound. We prove the necessary and sufficient conditions for tori that can be perfectly t-interleaved, and present efficient perfect t-interleaving constructions. The most important contribution of this paper is to prove that the t-interleaving numbers of tori large enough in both dimensions, which constitute by far the majority of all existing cases, is at most one more than
the sphere-packing lower bound, and to present an optimal and efficient t-interleaving scheme for them. Then we prove some bounds on the t-interleaving numbers for other cases, completing a general picture for the t-interleaving problem on 2-dimensional tori
Common metrics for cellular automata models of complex systems
The creation and use of models is critical not only to the scientific process, but also to life in general. Selected features of a system are abstracted into a model that can then be used to gain knowledge of the workings of the observed system and even anticipate its future behaviour. A key feature of the modelling process is the identification of commonality. This allows previous experience of one model to be used in a new or unfamiliar situation. This recognition of commonality between models allows standards to be formed, especially in areas such as measurement. How everyday physical objects are measured is built on an ingrained acceptance of their underlying commonality.
Complex systems, often with their layers of interwoven interactions, are harder to model and, therefore, to measure and predict. Indeed, the inability to compute and model a complex system, except at a localised and temporal level, can be seen as one of its defining attributes. The establishing of commonality between complex systems provides the opportunity to find common metrics. This work looks at two dimensional cellular automata, which are widely used as a simple modelling tool for a variety of systems. This has led to a very diverse range of systems using a common modelling environment based on a lattice of cells. This provides a possible common link between systems using cellular automata that could be exploited to find a common metric that provided information on a diverse range of systems. An enhancement of a categorisation of cellular automata model types used for biological studies is proposed and expanded to include other disciplines. The thesis outlines a new metric, the C-Value, created by the author. This metric, based on the connectedness of the active elements on the cellular automata grid, is then tested with three models built to represent three of the four categories of cellular automata model types. The results show that the new C-Value provides a good indicator of the gathering of active cells on a grid into a single, compact cluster and of indicating, when correlated with the mean density of active cells on the lattice, that their distribution is random. This provides a range to define the disordered and ordered state of a grid. The use of the C-Value in a localised context shows potential for identifying patterns of clusters on the grid
Research in structural and solid mechanics, 1982
Advances in structural and solid mechanics, including solution procedures and the physical investigation of structural responses are discussed
New advances in vehicular technology and automotive engineering
An automobile was seen as a simple accessory of luxury in the early years of the past
century. Therefore, it was an expensive asset which none of the common citizen could
afford. It was necessary to pass a long period and waiting for Henry Ford to establish
the first plants with the series fabrication. This new industrial paradigm makes easy to
the common American to acquire an automobile, either for running away or for
working purposes. Since that date, the automotive research grown exponentially to the
levels observed in the actuality. Now, the automobiles are indispensable goods; saying
with other words, the automobile is a first necessity article in a wide number of
aspects of living: for workers to allow them to move from their homes into their
workplaces, for transportation of students, for allowing the domestic women in their
home tasks, for ambulances to carry people with decease to the hospitals, for
transportation of materials, and so on, the list don’t ends. The new goal pursued by the
automotive industry is to provide electric vehicles at low cost and with high reliability.
This commitment is justified by the oil’s peak extraction on 50s of this century and also
by the necessity to reduce the emissions of CO2 to the atmosphere, as well as to reduce
the needs of this even more valuable natural resource. In order to achieve this task and
to improve the regular cars based on oil, the automotive industry is even more
concerned on doing applied research on technology and on fundamental research of
new materials. The most important idea to retain from the previous introduction is to
clarify the minds of the potential readers for the direct and indirect penetration of the
vehicles and the vehicular industry in the today’s life. In this sequence of ideas, this
book tries not only to fill a gap by presenting fresh subjects related to the vehicular
technology and to the automotive engineering but to provide guidelines for future
research.
This book account with valuable contributions from worldwide experts of
automotive’s field. The amount and type of contributions were judiciously selected to
cover a broad range of research. The reader can found the most recent and
cutting-edge sources of information divided in four major groups: electronics (power,
communications, optics, batteries, alternators and sensors), mechanics (suspension
control, torque converters, deformation analysis, structural monitoring), materials (nanotechnology, nanocomposites, lubrificants, biodegradable, composites, structural
monitoring) and manufacturing (supply chains).
We are sure that you will enjoy this book and will profit with the technical and
scientific contents. To finish, we are thankful to all of those who contributed to this
book and who made it possible.info:eu-repo/semantics/publishedVersio
- …