Implement of a high-performance computing system for parallel processing of scientific applications and the teaching of multicore and parallel programming

[EN] Increasingly complex algorithms for the modeling and resolution of different problems, which are currently facing humanity, has made it necessary the advent of new data processing requirements and the consequent implementation of high performance computing systems; but due to the high economic cost of this type of equipment and considering that an education institution cannot acquire, it is necessary to develop and implement computable architectures that are economical and scalable in their construction, such as heterogeneous distributed computing systems, constituted by several clustering of multicore processing elements with shared and distributed memory systems. This paper presents the analysis, design and implementation of a high-performance computing system called Liebres InTELigentes, whose purpose is the design and execution of intrinsically parallel algorithms, which require high amounts of storage and excessive processing times. The proposed computer system is constituted by conventional computing equipment (desktop computers, lap top equipment and servers), linked by a high-speed network. The main objective of this research is to build technology for the purposes of scientific and educational research.This project is sponsored by Tecnologico Nacional de México TecNM. 2018-2 110Velarde Martinez, A. (2019). Implement of a high-performance computing system for parallel processing of scientific applications and the teaching of multicore and parallel programming. En INNODOCT/18. International Conference on Innovation, Documentation and Education. Editorial Universitat Politècnica de València. 203-213. https://doi.org/10.4995/INN2018.2018.8908OCS20321

System structuring: a convergence of theory and practice?

Darwin is a general purpose structuring tool of use in building complex distributed systems from diverse components and diverse component interaction mechanisms. It is in essence a declarative binding language which can be used to define hierarchic compositions of interconnected components. Distribution is dealt with orthogonally to system structuring. The language allows the specification of both static structures and dynamic structures which evolve during execution. The central abstractions managed by Darwin are components and services. Bindings are formed by manipulating references to services. The paper describes the operational semantics of Darwin in terms of the pi-calculus, MilnerÆs calculus of mobile processes. The correspondence between the treatment of names in the pi-calculus and the management of service references in Darwin leads to an elegant and concise pi-calculus model of DarwinÆs operational semantics. The model has proved useful in arguing the correctness of Darwin implementations and in designing extensions to Darwin and reasoning about their behaviour. The paper discusses the reasons why other formalisms fail to capture elegantly the system structuring concepts on which Darwin is based

PRIMA : a DBMS prototype supporting engineering applications

The design of the Molecule-Atom Data model, aimed at the effective support of engineering applications, is justified and described with its essential properties and features. MAD offers direct and symmetric management of network structures and recursiveness, dynamic object definition and object handling allowing for both vertical and horizontal access. Its prototype implementation PRIMA is discussed using a multi-level model for the DBMS architecture. Our DBMS kernel provides a variety of access path structures, tuning mechanisms, and performance enhancements transparent at the data model interface. PRIMA is assumed to be used in different run-time environments including workstation coupling and multi-processor systems. In particular, it serves as a research vehicle to investigate the exploitation of "semantic parallelism" in single user operations

Programming Languages for Distributed Computing Systems

When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages. As distributed applications became more commonplace and more sophisticated, this ad hoc approach became less satisfactory. Researchers all over the world began designing new programming languages specifically for implementing distributed applications. These languages and their history, their underlying principles, their design, and their use are the subject of this paper. We begin by giving our view of what a distributed system is, illustrating with examples to avoid confusion on this important and controversial point. We then describe the three main characteristics that distinguish distributed programming languages from traditional sequential languages, namely, how they deal with parallelism, communication, and partial failures. Finally, we discuss 15 representative distributed languages to give the flavor of each. These examples include languages based on message passing, rendezvous, remote procedure call, objects, and atomic transactions, as well as functional languages, logic languages, and distributed data structure languages. The paper concludes with a comprehensive bibliography listing over 200 papers on nearly 100 distributed programming languages

SCENELAB: Scene Labelling by a Society of Agents; A Distributed Constraint Propagation System

This paper describes SCENELAB, a computer system for labelling line drawings of scenes in simple polyhedral worlds. The key idea behind SCENELAB is to bring together the concept of contraint-based filtering algorithms and the paradigm of societies of cooperating agents. The problem of finding labellings for pictures drawn from blocks world scenes has been taken as a sample application. Clearly, this makes SCENELAB no vision system, but we claim that a system designed along these lines could be part of a real vision system. Following e.g. Alan Mackworth, we argue that constraint exploitation on resp. between various representational levels is a key technique of ‘seeing things'. Furthermore, constraints and constraint propagation neatly fit into the framework of societies of agents, realized by asynchronuously concurrent processing units and message passing mechanisms. SCENELAB, as it is actually running, can be used to specify and solve arbitrary Labelling problems that can be seen as instances of a particular class of simple constraint problems based on finite, pseudo-transitive binary constraints. However, it is felt that the overall approach generalizes to arbitrary constraint problems. Emphasis is given to a mathematical model of the problem and its solution, to be able to specify the reasoning techniques of SCENELAB, and to identify the class of problems it can handle. I tried to shed some Light onto the methodological background of SCENELAB, which seems necessary to judge the achievements and disachievements of the present work. After some introductory chapters on the key concepts involved in SCENELAB, (scene) labelling problems, constraint propagation, and societies of agents, an overview on both the structure and behavior of SCENELAB is given in part B of the paper. In part C, then, an algebraic model is introduced, which serves as a base for discussing several approaches to labelling problems, namely Waltz's original Landmark algorithm, a synchronized parallel solution suggested by Azriel Rosenfeld, and clearly, the present approach. A proof of the correctness of SCENELABs algorithms is included. This proof takes into account the specifities of systems of asynchronously communicating agents where no global state is observable

Collected software engineering papers, volume 7

A collection is presented of selected technical papers produced by participants in the Software Engineering Laboratory (SEL) during the period Dec. 1988 to Oct. 1989. The purpose of the document is to make available, in one reference, some results of SEL research that originally appeared in a number of different forums. For the convenience of this presentation, the seven papers contained here are grouped into three major categories: (1) Software Measurement and Technology Studies; (2) Measurement Environment Studies; and (3) Ada Technology Studies. The first category presents experimental research and evaluation of software measurement and technology; the second presents studies on software environments pertaining to measurement. The last category represents Ada technology and includes research, development, and measurement studies

A configurable vector processor for accelerating speech coding algorithms

The growing demand for voice-over-packer (VoIP) services and multimedia-rich applications has made increasingly important the efficient, real-time implementation of low-bit rates speech coders on embedded VLSI platforms. Such speech coders are designed to substantially reduce the bandwidth requirements thus enabling dense multichannel gateways in small form factor. This however comes at a high computational cost which mandates the use of very high performance embedded processors. This thesis investigates the potential acceleration of two major ITU-T speech coding algorithms, namely G.729A and G.723.1, through their efficient implementation on a configurable extensible vector embedded CPU architecture. New scalar and vector ISAs were introduced which resulted in up to 80% reduction in the dynamic instruction count of both workloads. These instructions were subsequently encapsulated into a parametric, hybrid SISD (scalar processor)–SIMD (vector) processor. This work presents the research and implementation of the vector datapath of this vector coprocessor which is tightly-coupled to a Sparc-V8 compliant CPU, the optimization and simulation methodologies employed and the use of Electronic System Level (ESL) techniques to rapidly design SIMD datapaths

Course Catalog 1998-1999

ACADEMIC CALENDAR 4 THE CSU 7 THE UNIVERSITY 11 ACADEMIC PROGRAM 17 ACADEMIC SUPPORT SERVICES 25 STUDENT LIFE 27 ADMISSION 35 FEE SCHEDULE 43 ACADEMIC REGULATIONS 47 CERTIFICATE PROGRAMS 57 EXTENDED EDUCATION 59 UNDERGRADUATE DEGREE PROGRAMS 61 GRADUATE DEGREE PROGRAMS 327 FACULTY 461 APPENDIX 479 INDEX 488https://scholarworks.lib.csusb.edu/csusb-catalog/1002/thumbnail.jp