Operating Systems

Image removed.

The Operating Systems citations cover publications and presentations since fall of 2013. Specific works include studies on such as an empirical study showing that the performance difference between double hashing and fully random hashing appears negligible, how to structure parallel peeling algorithms, and about uniform quantization, Software-as-a-Service (SaaS)

  • “Participatory Networking: An API for Application Control of SDNs”, Andrew D. Ferguson, Arjun Guha, Chen Liang, Rodrigo Fonseca, and Shriram Krishnamurthi. In Proc. ACM SIGCOMM 2013, August 2013. The API presented by the authors enables users to work with the network, rather than around it, to improve performance and security. (ID#:14-1084) Available at: http://cs.brown.edu/~adf/work/SIGCOMM2013-paper.pdf
  • “Balanced Allocations and Double Hashing”, M. Mitzenmacher. Based on his studies, the author offers theoretical results to explain the behavior of double hashing in a specific context. (ID#:14-1085) Preliminary version at http://arxiv.org/abs/1209.5360
  • “Parallel Peeling Algorithms”, J. Jiang, M. Mitzenmacher, and J. Thaler. The authors provide insights into how to structure parallel peeling algorithms for efficiency in practice. (ID#:14-1086) Preliminary version at http://arxiv.org/abs/1302.7014
  • “Coding for Random Projections” P. Li, M. Mitzenmacher, and A. Shrivastava. The authors demonstrate that uniform quantization outperforms the standard method and propose that in many cases coding with just a small number of bits suffices. (ID#:14-1087) Preliminary version at http://arxiv.org/abs/1308.2218
  • “Equitability Analysis of the Maximal Information Coefficient, with Comparisons”, D. Reshef, Y. Reshef, M. Mitzenmacher, and P. Sabeti. (ID#:14-1088) Preliminary version at: http://arxiv.org/abs/1308.2218
  • “Simple Multi-Party Set Reconciliation”, M. Mitzenmacher and R. Pagh. The authors propose a methodology to achieve efficiency in network utilization. (ID#:14-1089) Preliminary version at: http://arxiv.org/abs/1311.2037
  • “Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream”, K. Chung, M. Mitzenmacher, and S. Vadhan, Theory of Computing , vol 9, pp. 897-945. The authors argue that given certain conditions, performance when choosing a hash function from a 2–universal family or a random hash function is essentially the same. (ID#:14-1090) Available at: http://theoryofcomputing.org/articles/v009a030/
  • "FChain: Toward Black-box Online Fault Localization for Cloud Systems”. Hiep Nguyen, Zhiming Shen, Yongmin Tan, Xiaohui Gu. Proc. of IEEE International Conference on Distributed Computing Systems (ICDCS), Philadelphia, PA, July, 2013. The authors present a system called FChain that can identify faulty components after a performance anomaly is detected. (ID#:14-1092) Available at: http://dance.csc.ncsu.edu/papers/icdcs2013.pdf
  • "Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds", Juan Du, Daniel Dean, Yongmin Tan, Xiaohui Gu, Ting Yu, IEEE Transactions on Parallel and Distributed Systems (TPDS), 2013. The authors propose a scheme that provides attacker pinpointing power that is stronger than earlier schemes. (ID#:14-1093) Available at: http://dance.csc.ncsu.edu/papers/tpds13_main.pdf
  • "Data-Centric OS Kernel Malware Characterization", Junghwan Rhee, Ryan Riley, Zhiqiang Lin, Xuxian Jiang, Dongyan Xu, IEEE Transactions on Information Forensics and Security (TIFS), accepted in 2013. (ID#:14-1094) Available upon release at: https://www.cs.purdue.edu/homes/dxu/pubs/soon.txt
  • "Protocol Responsibility Offloading to Improve TCP Throughput in Virtualized Environments", Sahan Gamage, Ardalan Kangarlou, Ramana Kompella, Dongyan Xu, ACM Transactions on Computer Systems (TOCS), 31(3), 2013. (ID#:14-1095) Available upon release at: https://www.cs.purdue.edu/homes/dxu/pubs/soon.txt
  • "Measuring and Detecting Malware Downloads in Live Network Traffic", Phani Vadrevu, Babak Rahbarinia, Roberto Perdisci, Kang Li, and Manos Antonakakis, Proceedings of 10th Conference on Detection of Intrusions and Malware & Vulnerability Assessment (DIMVA 2013). July, 2013. (Best Paper Award of DIMVA 2013.) The authors present Peer-Rush, a system for identifying, categorizing, and attributing unwanted P2P traffic. (ID#:14-1096) Available at: http://cobweb.cs.uga.edu/~kangli/src/dimva2013.pdf
  • “Preemptable Ticket Spinlocks: Improving Consolidated Performance in the Cloud”, J. Ouyang and J. Lange, Proceedings of the 9th Annual International Conference on Virtual Execution Environments, (VEE 2013). The authors demonstrate that Preemptable Ticket spinlocks improve VM performance. (ID#:14-1097) Available at: http://www.prognosticlab.org/~jarusl/pubs/vee13.pdf
  • "Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions”, Marian K. Iskander, Dave Wilkinson, Tucker Trainor, Adam J. Lee, and Panos Chrysanthis, IEEE Transactions on Parallel and Distributed Systems, 2014. The authors address the issue of unsafe decisions by policy-based authorization systems and define the idea of trusted transactions with respect to proofs of authorization. (ID#:14-1098) Available at: https://people.cs.pitt.edu/~adamlee/pubs/2013/iskander2013tpds.pdf
  • “Verifying computations without reexecuting them: from theoretical possibility to near-practicality”, Michael Walfish and Andrew J. Blumberg, Electronic Colloquium on Computational Complexity ECCC TR13-165, November 2013. (ID#:14-1099) Available at: http://eccc.hpi-web.de/report/2013/165/
  • “Verifying Computations with State”, Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg and Michael Walfish, ACM Symposium on Operating Systems Principles (SOSP), 14 Nov 2013. This paper describes Pantry, a system that composes proofbased verifiable computation with untrusted storage. (ID#:14-1100) Available at: http://eprint.iacr.org/2013/356.pdf

 

Note:

Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to SoS.Project (at) SecureDataBank.net for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.