Journal: D-INFK Technical Report

Abbreviation

Publisher

ETH Zurich, Department of Computer Science

Journal Volumes

ISSN

Description

Filters

Reset filters

Search Results

Publications 1 - 10 of 647
  • Parallel prefetching and caching is NP-hard
    Item type: Report
    Ambühl, Christoph; Weber, Brigitta (2003)
    D-INFK Technical Report
    In this paper we study integrated prefetching and caching in parallel disk systems. This topic has gained a lot of interest in the last years which manifests itself in numerous recent approximation algorithms. This paper provides the first negative result in this area. Specifically we show that computing an optimum prefetching/caching schedule for a parallel disk system is NP-hard, which settles an open problem posed in many papers.
  • BioOpera: Managing large-scale computations in bioinformatics
    Item type: Report
    Alonso, Gustavo; Bausch, Win; Hallett, M.T.; et al. (2000)
    D-INFK Technical Report
  • Dependable computing in virtual laboratories
    Item type: Report
    Alonso, Gustavo; Bausch, Win; Pautasso, Cesare; et al. (2000)
    D-INFK Technical Report
  • On lattice reduction for polynomial matrices
    Item type: Report
    Mulders, Thom; Storjohann, Arne (2000)
    D-INFK Technical Report
    A simple algorithm for transformation to weak Popov form | essentially lattice reduction for polynomial matrices | is described and analyzed. The algorithm is adapted and applied to various tasks involving polynomial matrices: rank prole and determinant computation; unimodular triangular factorization; transformation to Hermite and Popov canonical form; rational and diophantine linear system solving; short vector computation.
  • A predicate calculus with control of derivations
    Item type: Report
    Mey, Daniel (1989)
    D-INFK Technical Report
  • Certified sparse linear system solving
    Item type: Report
    Mulders, Thom (2000)
    D-INFK Technical Report
    In (Wiedemann, 1986) an algorithm is described for solving sparse lin- ear systems over nite elds. When the system does not have the desired properties for the algorithm to work, it is preconditioned to enforce these properties. In (Kaltofen and Saunders, 1991) another way of preconditioning for this problem is described. In (Giesbrecht et al., 1998) these techniques are used to obtain an algorithm for solving diophantine sparse systems over Z, including inconsistency certication. All these algorithms need coeÆcient elds/rings of suÆcient size. Otherwise nite eld/ring extensions have to be introduced. In (Mulders and Storjohann, 2000) an extended version of the diophantine solver is developed for dense systems. In this paper we will do the same for sparse systems. The algorithms will work for elds/rings of any size, so no eld/ring extensions are needed.
  • Improving customer proximity to railway stations
    Item type: Report
    Kranakis, Evangelos; Penna, Paolo; Schlude, Konrad; et al. (2002)
    D-INFK Technical Report
  • Latency-driven programming of computer networks
    Item type: Report
    Strumpen, Volker (1995)
    D-INFK Technical Report
  • Data Node Encrypted File System: Efficient Secure Deletion for Flash Memory
    Item type: Report
    Reardon, Joel; Capkun, Srdjan; Basin, David (2013)
    D-INFK Technical Report
    We propose the Data Node Encrypted File System (DNEFS), which uses on-the-fly encryption and decryption of file system data nodes to eciently and securely delete data on flash memory systems. DNEFS is a generic modication of existing flashfile systems or controllers that enables secure data deletion while preserving the underlying systems' desirable properties: application-independence,finegrained data access, wear-levelling, and efficiency. We describe DNEFS both abstractly and in the context of the flashfile system UBIFS. We propose UBIFSec, which integrates DNEFS into UBIFS. We implement UBIFSec by extending UBIFS's Linux implementation and we integrate UBIFSec in the Android operating system running on a Google Nexus One smartphone. We show that it is efficient and usable; Android OS and applications (including video and audio playback) run normally on top of UBIFSec. To the best of our knowledge, this work presents thefirst comprehensive and fully-implemented secure deletion solution that works within the specification of flash memory.
  • The Oberon system family
    Item type: Report
    Brandis, Marc; Crelier, Régis; Franz, Michael; et al. (1992)
    D-INFK Technical Report
Publications 1 - 10 of 647