Auflistung nach:
Auflistung P041 - ARCS 2004 - Organic and Pervasive Computing nach Erscheinungsdatum
1 - 10 von 45
Treffer pro Seite
Sortieroptionen
- KonferenzbeitragA framework for dependability evaluation of mechatronic units(ARCS 2004 – Organic and pervasive computing, 2004) Kochs, Hans-Dieter; Petersen, JörgMechatronic units are characterized by a complex interaction of functions from mechanics, electronics, communication and computer systems. These different fields of technology as well as influences from the operating environment must be reflected in the dependability consideration, for which so far no comprehensive framework exists. In this contribution, a framework for consideration of dependability of mechatronic units starting from a definition of the term 'dependability of mechatronic units' is proposed. Special attention is put on to the influence factors including human-machine interfaces, and real-world constraints, which thoroughly have to be identified and considered. Following questions have to be regarded: What is understood by the term dependability of mechatronic units? Which influencing factors have to be considered? How the dependability is assessed? This contribution also wants to initiate a scientific discussion outside the fault tolerance community.
- KonferenzbeitragComplementary circuits for on-line detection for 1-out-of-3 codes(ARCS 2004 – Organic and pervasive computing, 2004) Morozov, A.; Saposhnikov, V. V.; Saposhnikow, Vl. V.; Gössel, M.In this paper a new method for concurrent checking of an arbitrarily given combinational multi-output circuit f by use of an 1-out-of-3 code is presented. The circuit f is completed by an additional multi-output circuit g in such a way that the XOR-sums of the corresponding outputs of f or of the inverted outputs of f and g are elements of a 1-out-of-3 code. For efficiently checking the 1-out-of-3 encoded outputs also a new self-checking checker based on a three-rail checker cell is proposed. Index Terms: 1-out-of-3 code, on-line error detection, complementary circuit, totally self-checking 1-out-of-3 code checker.
- KonferenzbeitragSelf-checking carry-select adder with sum-bit duplication(ARCS 2004 – Organic and pervasive computing, 2004) Sogomonyan, E. S.; Marienfeld, D.; Ocheretnij, V.; Gössel, M.In this paper the first code-disjoint totally self-checking carry-select adder is proposed. The adder blocks are fast ripple adders with a single NAND-gate delay for carry-propagation per cell. In every adder block both the sum-bits and the corresponding inverted sum-bits are simultaneously implemented. The parity of the input operands is checked against the X OR-sum of the propagate signals. For 64 bits area and maximal delay are determined by the SYNOPSYS CAD tool of the EUROCHIP project. Compared to a 64 bit carry-select adder without error detection the delay of the most significant sum-bit does not increase. Compared to a completely duplicated code-disjoint carry-select adder we save 240 X OR-gates.
- KonferenzbeitragHigh-availability and standards - The way to go! (Abstract)(ARCS 2004 – Organic and pervasive computing, 2004) Reitenspieß, Manfred
- KonferenzbeitragOperating systems for FPGA based computers and their memory management(ARCS 2004 – Organic and pervasive computing, 2004) Danne, KlausWe introduce the concept of an operating system for platforms that consist beside memory and peripheral devices of FPGAs as the only computational resource. Applications can be developed independent from each other and due to device drivers with little dependency on the platform. The OS supports the multitasking execution of applications using static as well as dynamic resource assignment. A main focus of the paper is the management of the resource memory. Memory management as part of the OS is introduced which allows multiple tasks to access the same memory banks using virtual addressing and dynamic memory allocation. Access conflicts are solved by a priority based scheduling. Since no microprocessor is part of the system, the entire OS including its memory management is executed on the FPGAs.1
- KonferenzbeitragParallelism in a CRC coprocessor(ARCS 2004 – Organic and pervasive computing, 2004) Döring, AndreasCyclic Redundancy Checks (CRC) constitute an important class of hash functions for detecting changes in data blocks after transmission, storage and retrieval, or distributed processing. Currently, most sequential methods based on Horner's scheme are applied with some extensions or modifications. The flexibility of these methods with respect to the generator polynomial and the sequence of data processing is limited. A newly proposed algorithm and architecture [DW03, DW04] offer a high degree of flexibility in several aspects and provide high performance with a modest investment in hardware. The algorithm has inherent freedom for parallel processing on several levels, which is exploited in the proposed architecture. An early implementation gives quantitative results on cost and performance and suggests possible extensions and improvements. The algorithm, a typical system architecture, and the coprocessor's structure are described in this paper with an emphasis on parallelism.
- KonferenzbeitragDeriving dependability measures of measurements recorded in a matrix(ARCS 2004 – Organic and pervasive computing, 2004) Tschäche, OliverDependability benchmarking is meant to measure system characteristics like availability, reliablity, data integrity etc. Todays systems are working at high levels of these characteristics. Evaluation of these characteristics demands to inject faults forcing fault tolerant mechanisms to exercise their tasks. Observing the response of the system leads to measurements assessing the quality of these mechanisms. Our paper's focus is not on how to create a special dependability benchmark but on how to deduce significant dependability characteristics out of fault injection based measurements. We disclose which information we need for a general dependability benchmark, from whom they should be supplied and, finally, how to derive assessments of dependability metrics from this information. Our method is universally applicable to all fault injection based dependability benchmarking methods. Using one method for the presentation of dependability has several advantages: E.g. benchmarks become comparable to each other, benchmarkers faster learn how to interpret similarly looking results.
- KonferenzbeitragReconfigurable OPTO-ASICs as base for future self-organizing CMOS cameras(ARCS 2004 – Organic and pervasive computing, 2004) Fey, Dietmar; Schmidt, Daniel; Loos, AndreasWe investigated different parallel SIMD (single instruction multiple data) architectures based on pure programmable and reconfigurable approaches for their appropriateness for integration in an one chip high speed CMOS (complementary metal-oxide semiconductor) camera. Our goal is to combine parallel signal detection and parallel signal processing in one chip. By a logic synthesis we show that a reconfigurable combinatorial circuit based on morphological operations is superior for our purpose. Further we describe briefly how a such system can be expanded towards a self-organizing system.
- KonferenzbeitragTowards unified dependability modeling and analysis(ARCS 2004 – Organic and pervasive computing, 2004) Pataricza, András; Györ, FerencUnified dependability modeling and analysis consists of both functional and non-functional modeling and analysis techniques. Nowadays one of the most popular modeling techniques is UML. Functional properties of an UML model can be validated and verified by existing modeling tools. Checking of non-functional properties, like those related to dependability is of a growing importance while they cannot be easily derived from UML models. Despite the fact of the existence of a unified concept and terminology of dependability notions and mechanisms, little convergence is observable between the specific fields in dependability engineering. This paper presents a methodology for the uniform modeling of the different dependability related attributes.
- KonferenzbeitragVIA2SISCI – A new library that provides the VIA semantics forsci connected clusters(ARCS 2004 – Organic and pervasive computing, 2004) Mehlan, Torsten; Rehm, WolfgangNormally the SISCI interface provides a Distributed Shared Memory (DSM) [PTM97] abstraction using the Scalable Coherent Interface (SCI). This paper describes and discusses the design and the concepts behind a library called VIA2SISCI that we have developed. The library maps the semantics of the Virtual Interface Architecture (VIA) to SISCI-semantics and establishes a middleware between SISCI and highlevel communication facilities. We focus on several important concepts of VIA that had to be mapped to the SISCI services. The presented concepts may be interesting and useful beyond the scope of this paper.