Application software

About: Application software is a research topic. Over the lifetime, 12185 publications have been published within this topic receiving 219822 citations. The topic is also known as: software application & application software.

Software Reliability and Testing Time Allocation: An Architecture-Based Approach

Abstract: With software systems increasingly being employed in critical contexts, assuring high reliability levels for large, complex systems can incur huge verification costs. Existing standards usually assign predefined risk levels to components in the design phase, to provide some guidelines for the verification. It is a rough-grained assignment that does not consider the costs and does not provide sufficient modeling basis to let engineers quantitatively optimize resources usage. Software reliability allocation models partially address such issues, but they usually make so many assumptions on the input parameters that their application is difficult in practice. In this paper, we try to reduce this gap, proposing a reliability and testing resources allocation model that is able to provide solutions at various levels of detail, depending upon the information the engineer has about the system. The model aims to quantitatively identify the most critical components of software architecture in order to best assign the testing resources to them. A tool for the solution of the model is also developed. The model is applied to an empirical case study, a program developed for the European Space Agency, to verify model's prediction abilities and evaluate the impact of the parameter estimation errors on the prediction accuracy.

An agent-based decision support system for wholesale electricity market

Abstract: Application software has been developed for analyzing and understanding a dynamic price change in the US wholesale power market. Traders can use the software as an effective decision-making tool by modeling and simulating a power market. The software uses different features of a decision support system by creating a framework for assessing new trading strategies in a competitive electricity trading environment. The practicality of the software is confirmed by comparing its estimation accuracy with those of other methods (e.g., neural network and genetic algorithm). The software has been applied to a data set regarding the California electricity crisis in order to examine whether the learning (convergence) speed of traders is different between the two periods (before and during the crisis). Such an application confirms the validity of the proposed software.

The Touchstone 30 Gigaflop DELTA Prototype

Abstract: In Sep tember , 1990, the Intel C o r p o r a t i o n demonstrated the third of four major Touchstone Program prototype systems. Denoted DELTA, the prototype scales to over 500 nodes, provides aggregate peak performance in excess of 30 GFLOP’s, and contains a new ,interconnect network based on a Caltech-designed router device. DELTA contains four heterogeneous node types f o r numeric, service, inputloutput, and network fmctions. The operating system supports message-passing paradigms and intefaces with a Concurrent File System. Users access DELTA across a local area network and may select either the C or FORTRAN programmin,g languages. An interactive parallel debugger assists in application development and performance tuning.

Hardware and software fault tolerance: a unified architectural approach

Abstract: A computer architecture, FTP-AP, has been designed that can efficiently implement N-version fault-tolerant software and still tolerate random hardware failures with extremely high coverage. A unified architectural approach extends a well-known hardware fault tolerant without violating the fundamental hardware fault-tolerance design principles, and it provides a possible solution to the problem of correlated software errors. >

Massively parallel computing systems with real time constraints: the "Algorithm Architecture Adequation" methodology

Abstract: Massively Parallel Computing Systems (MPCS) provide high performance computing generally used to accelerate numerical computation applications. We present a methodology called "Algorithm Architecture Adequation" used to take advantage of the computation power of these systems in the case of real-time applications. With this methodology, the application algorithm as well as the MPCS are specified with graphs, then the implementation of an algorithm on a MPCS in respect with real-time constraints may be formalized in terms of graph transformations. This allows one to optimize the real-time performances of the implementation taking into account critical inter-processor communications. As a result, real-time distributed executives are produced automatically without dead-lock and with minimum overhead. This reduces drastically the development cycle for real-time applications running on MPCS. >