Wait states in parallel applications can be identified by scanning event traces for characteristic patterns. In our earlier work we defined such inefficiency patterns for MPI-2 one-sided communication, although still ...
详细信息
A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel...
详细信息
A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for interprocess communication, relieving the application developer of the cumbersome task of mapping logical neighbours to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server which then is used in the generation of the topological specification.
We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used...
详细信息
We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used for specifying real time systems. In our framework, a user models the ordering of real time events as the grammar of a language accepted by a timed automata, the real time constraints on these events are then captured as denotations of the grammar productions specified by the user. The grammar can be specified as a Definite Clause Grammar (DCG), while the denotations can be specified in constraint logic. The resulting specification can hence be regarded as a constraint logic program (CLP), and is executable. Many interesting properties of the real time system can be verified by posing appropriate queries to this CLP program. A major advantage of our approach is that it is constructive in nature, i.e., it can be used for computing the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call constraint automata and timed push down automata.
Renovation of business-critical software is becoming increasingly important. We identify fundamental notions and techniques to aid in system renovation and sketch some basic techniques: generic language technology to ...
详细信息
orthogonal and quasi-orthogonal matrices with a limited number of element values and structured in some way are of considerable interest for many technical applications related to image processing and signal coding. T...
orthogonal and quasi-orthogonal matrices with a limited number of element values and structured in some way are of considerable interest for many technical applications related to image processing and signal coding. The paper classifies and considers cyclic matrices and matrices with cyclic blocks. Descriptions of noise-resistant encoding methods of images and their protective masking using such matrices are given. Based on the analysis of the autocorrelation functions of new code sequences obtained from strings of modified cyclic quasi-orthogonal matrices and the simulation performed, numerical values of the quality parameters of the new code sequences are given. It is shown that their application makes it possible to reduce the maximum level of the side lobe of the aperiodic autocorrelation function, which allows us to conclude that their application is promising and that signal coding algorithms can be revised.
Modelica is a general equation-based object-oriented language for continuous and discrete-event modeling of physical systems for the purpose of efficient simulation. The language unifies and generalizes previous objec...
详细信息
Modelica is a general equation-based object-oriented language for continuous and discrete-event modeling of physical systems for the purpose of efficient simulation. The language unifies and generalizes previous object-oriented modeling languages. It is bringing about a revolution in this area, based on its ease of use, visual design of models with combination of Lego-like predefined model building blocks, its ability to define model libraries with re-usable components and its support for modeling and simulation of complex applications involving parts from several application domains. In this paper we present the Modelica language with emphasis on its language features and one of the associated simulation environments. Simulation models can be developed in an integrated problem-solving environment by using a graphical editor for connection diagrams. Connections are established just by drawing lines between objects picked from a class library. The principles of object oriented physical systems modeling and the multi-domain capabilities of the language are presented in the paper by several examples.
作者:
Gupta, GopalPontelli, EnricoApplied Logic
Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic
Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States
Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logi...
详细信息
Autonomic computing - self-configuring, self-healing, self-optimizing applications, systems and networks - is widely believed to be a promising solution to ever-increasing system complexity and the spiraling costs of ...
详细信息
Autonomic computing - self-configuring, self-healing, self-optimizing applications, systems and networks - is widely believed to be a promising solution to ever-increasing system complexity and the spiraling costs of human system management as systems scale to global proportions. Most results to date, however, suggest ways to architect new software constructed from the ground up as autonomic systems, whereas in the real world organizations continue to use stovepipe legacy systems and/or build ''systems of systems'' that draw from a gamut of new and legacy components involving disparate technologies from numerous vendors. Our goal is to retrofit autonomic computing onto such systems, externally, without any need to understand or modify the code, and in many cases even when it is impossible to recompile. We present a meta-architecture implemented as active middleware infrastructure to explicitly add autonomic services via an attached feedback loop that provides continual monitoring and, as needed, reconfiguration and/or repair. Our lightweight design and separation of concerns enables easy adoption of individual components, as well as the full infrastructure, for use with a large variety of legacy, new systems, and systems of systems. We summarize several experiments spanning multiple domains.
For several years, traffic congestion has been a major problem in big cities where the number of cars and different means of transportation has been increasing significantly. The problem of congestion is becoming more...
详细信息
Efficiently using the computational power made available through desktop grids based distributed systems is a complicated and many-sided problem, caused by the intermittent resource availability. In this paper a novel...
详细信息
ISBN:
(纸本)9781424435692
Efficiently using the computational power made available through desktop grids based distributed systems is a complicated and many-sided problem, caused by the intermittent resource availability. In this paper a novel solution is presented for predicting the runtimes of parameter sweep jobs. These jobs are characterized by their lack of inter-dependence and suitability for runtime prediction by modeling. This makes them ideal candidates for deployment on volatile grid configurations using prediction based techniques. The parameter sweep prediction framework used to make the predictions is referred to as GIPSy (grid information prediction system). Previous research involving GIPSy has focused on results obtained during simulation were it is necessary to make some basic assumptions. By combining GIPSy with PGS (prediction based grid scheduling), an actual grid implementation, real results can be obtained. A detailed comparison between the expected results, based on simulation analysis, and the final results is given. Discrepancies are highlighted and possible causes are identified, solutions are proposed and implemented. By comparing the results for different model building configurations an optimal configuration is found that produces reliable result independent of the chosen job type. Results are presented for a quantum physics problem and two simulated workloads represented by sleep jobs.
暂无评论