{"title":"Validation of object oriented models using animation","authors":"I. Oliver, S. Kent","doi":"10.1109/EURMIC.1999.794786","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794786","url":null,"abstract":"Experience has shown that prototyping is a valuable technique in the validation of designs. However the prototype(s) can be too far semantically removed from the design. Animation is a technique where a design itself can be 'executed' without the need to translate to a high-level language to build a prototype. While animation has been implemented with formal specification languages such as VDM, Z and B and used with some success, we feel that its application to a more graphical specification language/notation would introduce animation to a wider range of software designers. This paper discusses the basis of a technique for the animation of rigorously specified object-oriented models written using the Unified Modelling Language and the Object Constraint Language.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125255047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"JFS: a secure distributed file system for network computers","authors":"M. O'Connell, P. Nixon","doi":"10.1109/EURMIC.1999.794813","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794813","url":null,"abstract":"Network-centric computing aims to solve the problems associated with traditional client/server systems, namely the high performance requirements, and costly maintenance of, the computing resources. With the network-centric model, applications are stored on servers and downloaded to clients as required, where they are then executed locally. User data is saved back to the remote server-local user data is only temporary. However these applications lack a standard file system where they can store their data files. For instance, when these applications are run as Java applets in a web browser, they are prevented from accessing the local storage system by the Java environment. This paper proposes the Java File System (JFS), a distributed file system for use by these applications, which provides strong security and client/server heterogeneity.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133227510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. L. Núñez, C. F. Uribe, Simon R. Jones, S. Bateman
{"title":"The X-MatchLITE FPGA-based data compressor","authors":"J. L. Núñez, C. F. Uribe, Simon R. Jones, S. Bateman","doi":"10.1109/EURMIC.1999.794458","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794458","url":null,"abstract":"This paper introduces a hardware amenable algorithm for lossless data compression and a highly integrable architecture which enables Gbit/s compression using contemporary ASIC technology. An FPGA prototype of the architecture is presented. A comparison between this prototype and the full version of the system is made together with the details of the engineering decisions needed to successfully realize an ASIC compressor in FPGA technology.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114463004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Specialised processor for channel allocation in a cellular mobile network","authors":"K. Leung, A. Postula","doi":"10.1109/EURMIC.1999.794442","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794442","url":null,"abstract":"The capacity of the current cellular mobile telephone networks has the potential to be doubled by adapting transmission power control strategies into the control stations. We propose a new channel assignment method, which combines power control and distributed balancing algorithm. In contrast with centralised control methods, the proposed algorithm has much less communication overhead and requires simpler computations to be executed in parallel on different cells. Conventional processors can be used to perform these calculations reside within the algorithm. However, we propose using simple specialised hardware, which outperforms conventional processors in mathematical intensive algorithms and large number of I/O operations. The dedicated hardware allows all channels within the cell to be balanced at the same time, resulting in optimal channel utilisation.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lookahead cache with instruction processing unit for filling memory gap","authors":"L. Sanli, Huang Zhenchun","doi":"10.1109/EURMIC.1999.794471","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794471","url":null,"abstract":"Memory Gap has became an essential factor influencing on achieving peak performance of high-speed CPU based systems. To fill this gap, enlarging cache capacity is a traditional method formed from the program locality principle. However, the order of instructions stored in I-Cache before being sent to the Data Processing Unit (DPU) is a type of useful information that has never been utilized. So we propose an architecture containing an Instruction Processing Unit (IPU) in parallel with the ordinary DPU. The IPU can prefetch, analyze and preprocess a large amount of instructions which would otherwise lie in the I-Cache untouched. It would be more efficient than the conventional prefetch buffer that can only store a few instructions for previewing. With IPU, load instructions can be preprocessed while the DPU is executing data simultaneously. We term it as Lookahead Cache. The paper describes the principle of Lookahead Cache, presents the idea of dynamic program locality and illustrates quantitative parameters for evaluation. Tools for simulating the Lookahead Cache were developed. Simulation results shows that it can improve the program locality, and hence improve the cache hit ratio during program execution without further enlarging the on-chip cache that occupies a large portion of chip area.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117282130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automating SCM metric data collection and analysis in virtual software corporations","authors":"Jussi Ronkainen, Tua Rahikkala, Rod Blackwood","doi":"10.1109/EURMIC.1999.794792","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794792","url":null,"abstract":"The Virtual Software Corporation (VSC) represents an organisational structure addressing the needs of distributed software development. Research indicates that Software Configuration Management (SCM) is one of the most important challenges faced by VSCs, requiring support and continued improvement. The real influences of the VSC structure on the SCM process are, however, not fully known yet. The aim of this paper is to present an approach to make the SCM process more visible within the VSCs.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129513355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Requirements change: a dissection of management issues","authors":"W. Lam, V. Shankararaman","doi":"10.1109/EURMIC.1999.794787","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794787","url":null,"abstract":"Increasingly, customers expect modern software systems to be evolvable and sufficiently flexible to accommodate changing users needs. This expectation, however, is untempered by the fact that changing requirements are recognised as a major cause of project failure, and over time, can have a degrading effect on the underlying design of a system. There is a need therefore, for organisations to develop best practices for managing requirements change. This paper provides an analysis of core issues in the management of requirements change, e.g. requirements identification, impact analysis, change prioritisation and change measurement. For each issue, we describe the (a) goal to be achieved, (b) failure mode to avoid, (c) management strategies to adopt, and (d) metrics that support the management strategy. The paper contributes practical guidance on managing requirements change that is independent of application domain and specification notations.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128385300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Error recovery using forced validity assisted by executable assertions for error detection: an experimental evaluation","authors":"M. Hiller","doi":"10.1109/EURMIC.1999.794768","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794768","url":null,"abstract":"This paper proposes and evaluates error detection and recovery mechanisms suitable for embedded systems. The purpose of these mechanisms is to provide detection of and recovery from data errors in internal variables. A classification scheme for variables enables us to construct a parameterised detection and recovery mechanism for each variable. Error detection is handled by executable assertions and recovery is attempted by forcing an erroneous variable into the valid domain of that variable. The effect on failure probability from some of the proposed mechanisms is evaluated in an error injection experiment targeting an embedded system. Errors were injected into the original system without mechanisms as well as into an instrumented system. Results show that the failure probability decreased most for errors in monitored variables and very little for errors in variables that were not directly monitored. For errors in the stack and CPU registers, no significant change was observed.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126204920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"HW/SW co-simulation of target C++ applications and synthesizable HDL with performance estimation","authors":"Gregor Polansek, A. Zemva, A. Trost","doi":"10.1109/EURMIC.1999.794511","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794511","url":null,"abstract":"In this paper we present an environment for synthesis and simulation of the industrial digital system composed of the target microprocessor, memory and hardware devices. We use C++ for coding the program for the target microprocessor and VHDL for describing the operations in hardware. The presented system combines C++ compiler and VHDL tools for simulating the design. The applicability of the environment for performance estimation of the designed digital system is demonstrated.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115865542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of multidimensional retiming and matroid theory to DSP algorithm parallelization","authors":"F. Fernández, Ángel Sánchez","doi":"10.1109/EURMIC.1999.794519","DOIUrl":"https://doi.org/10.1109/EURMIC.1999.794519","url":null,"abstract":"This paper presents a novel optimization methodology to implement parallel DSP algorithms based on the application of general multidimensional retiming techniques and graphic matroid theory. These methods improve the throughput of a synchronous circuit and guarantee that all functional elements work in parallel. This approach is also used to achieve full parallelism in multiprocessor architecture. Three multidimensional retiming methods: node, cocycle and cycle are introduced to assist the digital designer in DSP algorithms parallelization. The main theoretical advantage of this approach is a deeper formal treatment of the set of data dependences for the considered algorithms. This orientation also provides an intuitive tool for the graphical analysis and design of the corresponding systems, and a mathematical tool for analysing and transforming (retiming) the involved algorithms. Application of these matrix optimization techniques to the optimal delay management problem for multidimensional DSP algorithms is also shown.","PeriodicalId":249552,"journal":{"name":"Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134374289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}