Browse Research and Tech Reports - Computer Science by Title

  • Newell, James; Gupta, Indranil (2005-02)
    Peer-to-peer distributed hash tables (p2p DHTs) are individually built by their designers with specific performance goals in mind. However, no individual DHT can satisfy an application that requires a "best of all worlds" ...

    application/pdf

    application/pdfPDF (376Kb)
  • Ashnia, Shadi; Hart, John C. (2007-10)
    In this paper we propose a system for painting on surfaces. This system is based on moving charts. At each moment, a local patch is selected on the surface. The patch is formed such that it covers an area on which an artist ...

    application/pdf

    application/pdfPDF (11Mb)
  • Kim, Cheolgi; Al-Nayeem, Abdullah; Yun, Heechul; Wu, Po-Liang; Sha, Lui (2011-08-11)
    This Software Design Description (SDD) provides detailed information on the architecture and coding for the PRISM C++ library (version 0.51). The PRISM C++ library supports consistent information sharing and in- teractions ...

    application/pdf

    application/pdfPDF (2Mb)
  • Sha, Lui; Al-Nayeem, Abdullah; Sun, Mu; Meseguer, Jose; Olveczky, Peter C. (2009-05-26)
    In networked cyber physical systems real time global computations, e.g., the supervisory control of a ight control system, require consistent views, consistent actions and synchronized state transitions across net- work ...

    application/pdf

    application/pdfPDF (376Kb)
  • Snir, Marc (2006-07)
    The report presents the design for a new parallel programming language, PPL1. The language borrows on Java and provides a global view of data and control, while allowing user control of resource allocation and data ...

    application/pdf

    application/pdfPDF (309Kb)
  • Bocchino, Robert L., Jr.; Adve, Vikram S.; Adve, Sarita V.; Snir, Marc (2008-11)
    We examine the problem of providing a parallel programming model that guarantees deterministic semantics. We propose a research agenda focusing on the following questions: 1. How to guarantee determinism in a modern ...

    application/pdf

    application/pdfPDF (73Kb)
  • Bocchino, Robert L., Jr.; Adve, Vikram S.; Adve, Sarita V.; Snir, Marc (2008-10)
    We examine the problem of providing a parallel programming model that guarantees deterministic semantics. We propose a research agenda focusing on the following questions: 1. How to guarantee determinism in a modern ...

    application/pdf

    application/pdfPDF (73Kb)
  • Bikshandi, Ganesh (2007-01)
    Writing high performance programs is a non-trivial task and remains a challenge even to advanced programmers. This dissertation describes a new data type, Hierarchically Tiled Array (HTA), that simplifies this task. HTAs ...

    application/pdf

    application/pdfPDF (2Mb)
  • Choi, Byn; Komuravelli, Rakesh; Lu, Victor; Sung, Hyojin; Bocchino, Robert L., Jr. (2009-09-22)
    The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations between rays and the primitives. The highest ...

    application/pdf

    application/pdfPDF (1Mb)
  • Gupta, Abhishek; Heumann, Stephen; Krejcie, Alex (2010-10-31)
    This paper addresses the problem of Automated Video Surveillance (AVS), which involves automatically analyzing surveillance videos to detect suspicious or otherwise interesting activity. Interest in AVS is rapidly growing ...

    application/pdf

    application/pdfPDF (352Kb)
  • Chen, Feng; Rosu, Grigore (2007-01)
    Happen-before causal partial order relations have been widely used in concurrent program verification and testing. In this paper, we present a parametric approach to happen-before causal partial orders. All existing variants ...

    application/pdf

    application/pdfPDF (130Kb)
  • Chen, Feng; Rosu, Grigore (2006-04)
    A parametric approach to control dependence is presented, where the parameter is any prefix-invariant property on paths in the control-flow graph. Existing control dependencies, both direct and indirect, can be obtained ...

    application/pdf

    application/pdfPDF (156Kb)
  • Rosu, Grigore; Chen, Feng (2008-07)
    Trace analysis plays a fundamental role in many program analysis approaches, such as runtime verification, testing, monitoring, and specification mining. Recent research efforts bring empirical evidence that execution ...

    application/pdf

    application/pdfPDF (649Kb)
  • Ramasamy, HariGovind Venkatraj (2005-12)
    We consider the subject of tolerance of the most severe kind of faults, namely Byzantine faults, through state machine replication in asynchronous environments such as the Internet. In Byzantine-fault-tolerant (BFT) state ...

    application/pdf

    application/pdfPDF (941Kb)
  • Padioleau, Yoann (2008-10)
    It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use of the C pre-processor (cpp), especially ifdefs and ...

    application/pdf

    application/pdfPDF (189Kb)
  • Padioleau, Yoann (2008-10)
    It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use of the C pre-processor (cpp), especially ifdefs and ...

    application/pdf

    application/pdfPDF (189Kb)
  • Farzan, Azadeh; Meseguer, Jose (2005-06)
    Partial order reduction (POR) capabilities are typically added by extending a model checking algorithm supporting analysis of programs in a given programming language. In this paper we propose a generic method to generate ...

    application/pdf

    application/pdfPDF (189Kb)
  • Fesehaye, Debessay; Nahrstedt, Klara (2010)
    Denial of Service (DoS) and Distributed DoS (DDoS) attacks have proven to be increasing threats to our digital world. There are many approaches for trying to deal with these threats. With significant overhead and computational ...

    application/pdf

    application/pdfPDF (333Kb)
  • Al-Nayeem, Abdullah; Sha, Lui; Cofer, Darren D.; Miller, Steven M. (2012-02-20)
    Designing and verifying distributed protocols in a multi-rate asynchronous system is, in general, extremely difficult when the distributed computations require consistent input views, consistent actions and synchronized ...

    application/pdf

    application/pdfPDF (1Mb)
  • Tasharofi, Samira and Johnson, Ralph (2011-02)
    Concurrent programs are hard to test because of the non- determinism inherit in them. Since non-determinism is one of the major sources of bugs, it is important to to be tested. We studied the test suites of four open ...

    application/pdf

    application/pdfPDF (330Kb)