Browsing Computer and Information Science Faculty Research by Issue Date

Navigation

Display Options

Results

  • Parallel Logic Programs on the HP Mayfly 
    Conery, John S. (University of Oregon, 1990-12-07)
    The Mayfly, a parallel processor being built at HP Labs in Palo Alto, has architectural support for several import.ant. aspects of the OM virtual machine for parallel logic programs. Each node has a coprocessor that is ...
  • RAGA: Musical Gantt Charts for Scheduling in Distributed Real Time Systems 
    Lo, Virginia M.; Pall, Gurdeep Singh (University of Oregon, 1991-01)
    We propose a simple extension to Gantt charts, called RAGA scores, for use in distributed real time scheduling. RAGA scores use a small set of symbols borrowed from musical notation to enrich the expressive power of the ...
  • Macros That Work 
    Clinger, William D.; Rees, Jonathan (University of Oregon, 1991-01)
    This paper describes a modified form of Kohlbecker's algorithm for reliably hygienic (capture-free) macro expansion in block-structured languages, where macros are source-tos-ource transformations specified using a ...
  • Distributed Shared Memory: A Survey of Issues and Algorithms 
    Lo, Virginia M.; Nitzberg, Bill (University of Oregon, 1991-01-07)
    A distributed shared memory (DSM) is an implementation of the shared memory abstraction on a multicomputer architecture which has no physically shared memory. Shared memory is important (as a programming model) not only ...
  • Revised 3.99 Report on the Algorithmic Language Scheme 
    Clinger, William D.; Rees, Jonathan (University of Oregon, 2004-10)
    The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay ...
  • GLOWS: A high-fidelity worm simulator 
    Ehrenkranz, Toby; Knickerbocker, Paul, 1980-; Li, Jun; Stafford, Shad (2006)
    This work presents our GLOWS (Gateway Level Oregon Worm Simulator) simulator, designed to produce realistic worm traffic over a broad range of scenarios. GLOWS simulates the spread of a worm across the Internet and its ...
  • Cooperative Policy Control for Peer-to-Peer Data Distribution 
    Anderson, Eric; Li, Jun (2010-03-10)
    Many network applications (such as swarming downloads, peer-to-peer video streaming and file sharing) are made possible by using large groups of peers to distribute and process data. Securing data in such a system ...

Search Scholars' Bank


Advanced Search

Browse

My Account

Statistics