This is a collection of technical reports from the Cornell's Computing and Information Science (CIS) Department from the time period of 2003-present. These reports are part of the NCSTRL collection of Computer Science Technical Reports.

For reports prior to 2003, see the Computer Science Technical Reports Collection.

Recent Submissions

  • Pushing Bytes: Cloud-Scale Data Replication with RDMC 

    Behrens, Jonathan; Jha, Sagar; Tremel, Edward; Birman, Ken (2017-06)
    Data center infrastructures frequently replicate objects to create backups or to copy executables and input files to compute nodes. This task occurs under time pressure: data is at risk of loss until replicated for ...
  • Shoal: A Lossless Network for High-density and Disaggregated Racks 

    Shrivastav, Vishal; Valadarsky, Asaf; Ballani, Hitesh; Costa, Paolo; Lee, Ki Suh; Wang, Han; Agarwal, Rachit; Weatherspoon, Hakim (2017-04-30)
    Rack-scale computers comprise hundreds of micro-servers connected to internal storage and memory through an internal network. However, their density and disaggregated nature pose a problem for existing packet-switched ...
  • Full-Processor Timing Channel Protection with Applications to Secure Hardware Compartments 

    Ferraiuolo, Andrew; Wang, Yao; Xu, Rui; Zhang, Danfeng; Myers, Andrew; Suh, Edward (2017-04-25)
    This paper presents timing compartments, a hardware architecture abstraction that eliminates microarchitectural timing channels between groups of processes of VMs running on shared hardware. When coupled ...
  • Unrestricted Stone Duality for Markov Processes 

    Furber, Robert; Kozen, Dexter; Larsen, Kim; Mardare, Radu; Panangaden, Prakash (2017-02-23)
    Stone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound in computer science and have been of great use in understanding the relationship between computational models and the ...
  • Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ 

    Smyth, Ben; Frink, Steven; Clarkson, Michael R. (2017-02-13)
    Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors ...

View more

Statistics

RSS Feeds