By Topic

Software, IEE Proceedings -

Issue 2 • Date Apr 2000

Filter Results

Displaying Results 1 - 4 of 4
  • Analysis Prediction Template Toolkit (APTT) for object-based computation

    Page(s): 37 - 47
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1304 KB)  

    The Analysis, Prediction, Template Toolkit (APTT) is an integrated set of visualisation tools aimed at the design of continuous-flow, multi-algorithm embedded applications in the multimedia, signal-processing domain. APTT is constrained by a pipelined design pattern, with each stage of the pipeline capable of supporting internal parallelism. APTT includes three tools. The graphical simulation tool predicts pipeline metrics: memory, interconnect bandwidth; throughput; and latency (both mean and maxima); before parallel partitioning is carried out. A post-mortem trace analysis tool with the same format as the predictor tool enables performance of parallelised applications to be checked and optimised. A semi-manual code generator tool has been designed to support APTT templates, a means of rapidly prototyping processing pipelines. The results for performance prediction with the predictor tool on a machine-vision application are compared with actual execution times for a realistic application, and show a prediction accuracy within 10%. The worked example also includes details of a form of high-level codesign whereby cross-architectural comparisons of performance can be made. The paper discusses a template for an actor software object, a semi-dynamic structure with object-loading and reflection based around Java Remote Method Invocation (RMI) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented preprocessor fit for C++

    Page(s): 49 - 58
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (816 KB)  

    C++ retains the ANSI C preprocessor, although its limitations have been widely recognised. The authors describe FOG, a meta-compiler for a super-set of C++, that provides replacement preprocessing and introduces static meta-programming, while preserving the spirit of C++. They show how implementation of preprocessor functionality in an object-oriented style eliminates unnecessary replication from practical C++ programs, and supports recent object-oriented programming developments to a much greater extent than existing tools View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software as a corporate asset

    Page(s): 31 - 36
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (624 KB)  

    Software engineers frequently claim that companies undervalue their software and that they should regard it as a capital asset to be placed on the balance sheet. To a considerable extent, existing accounting regulations permit this but the regulations are only permissive, they do not require it to be treated in this way and, in practice, it rarely is. The author discusses the circumstances in which such treatment is appropriate, both for end user software and for software intended to be traded. The discussion is oriented towards UK accounting practice but some aspects of US practice are briefly described. The author concludes by making some recommendations for the treatment of software on the balance sheet, all of which are consistent with the present regulatory regime; the adoption of these recommendations would lead to more frequent capitalisation of software View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural performance measure of evolutionary testing applied to worst-case timing of real-time systems

    Page(s): 25 - 30
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (588 KB)  

    Evolutionary testing is a new testing technique for automatically generating test cases which satisfy a given test criterion. For best or worst-case execution time assessment of real-time systems it can be used to generate test cases which minimise or maximise execution times or possibly violate the timing specification of the system. As a typical search or optimisation technique, evolutionary testing cannot guarantee to find test cases according to the test objective. The only outcome of such a search process is the time found, but there is no information on how close the result comes to the actual minimal or maximal time. Experiments with this testing technique established a relationship between the complexity of a test object and the success of the search process to find optimal or near optimal solutions. The paper can be seen as an initial attempt to define a predictive complexity measure which is able to indicate the degree of how successfully an evolutionary search might have performed on a test object. The measure is simple and easy to retrieve as it is based on a program's source code. It is extensible, which is important for a further improvement in accuracy. The application of the new measure has shown to be successful for many example test programs but also revealed weaknesses on test objects whose complexity is difficult to capture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.