Now showing items 216-235 of 309

    • RCMP: A System Enabling Efficient Re-computation Based Failure Resilience for Big Data Analytics 

      Dinu, Florin; Ng, T. S. Eugene (2013-04-30)
      Multi-job I/O-intensive big-data computations can suffer a significant performance hit due to relying on data replication as the main failure resilience strategy. Data replication is inherently an expensive operation for ...
    • Reasoning About Multi-Stage Programs 

      Inoue, Jun; Taha, Walid (2011-10-15)
      We settle three basic questions that naturally arise when verifying multi-stage functional programs. Firstly, does adding staging to a language compromise any equalities that hold in the base language? Unfortunately it ...
    • Reasoning About Staged Programs 

      Inoue, Jun; Taha, Walid (2009-07-14)
      Multi-stage programming (MSP) is a style of writing program generators---programs which generate programs---supported by special annotations that direct construction, combination, and execution of object programs. Various ...
    • Reasoning about Strategies: on the Satisfiability Problem 

      Mogavero, Fabio; Murano, Aniello; Perelli, Giuseppe; Vardi, Moshe Y. (2017)
      Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns ...
    • Reconstructing rooms using photon echoes: A plane based model and reconstruction algorithm for looking around the corner 

      Pediredla, Adithya Kumar; Buttafava, Mauro; Tosi, Alberto; Cossairt, Oliver; Veeraraghavan, Ashok (2017)
      Can we reconstruct the entire internal shape of a room if all we can directly observe is a small portion of one internal wall, presumably through a window in the room? While conventional wisdom may indicate that this is ...
    • Reducing the Impact of Spill Code 

      Harvey, Timothy J. (1998-07-24)
      All graph-coloring register allocators rely on heuristics to arrive at a "good" answer to the NP-complete problem of register allocation, resulting in suboptimal code due to spill code. We look at a post-pass to the allocator ...
    • Register Allocation using Bipartite Liveness Graphs 

      Barik, Rajkishore; Sarkar, Vivek; Zhao, Jisheng (2010-10-12)
      Register allocation is an essential optimization for all compilers. A number of sophisticated register allocation algorithms have been developed based on Graph Coloring (GC) over the years. However, these algorithms pose ...
    • Register Allocation via Graph Coloring 

      Briggs, Preston (1992-04)
      Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are ...
    • Regular Real Analysis 

      Chaudhuri, Swarat; Sankaranarayanan, Sriram; Vardi, Moshe Y. (2013)
      We initiate the study of regular real analysis, or the analysis of real functions that can be encoded by automata on infinite words. It is known that ω-automata can be used to represent {relations} between real ...
    • Relating Linear and Branching Model Checking 

      Kupferman, Orna; Vardi, Moshe Y. (1998-06-08)
      The difference in the complexity of branching and linear model checking has been viewed as an argument in favor of the branching paradigm. In particular, the computational advantage of CTL model checking over LTL model ...
    • Relentful Strategic Reasoning in 1 Alternating-Time Temporal Logic 

      Mogavero, Fabio; Murano, Aniello; Vardi, Moshe Y. (2014)
      Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, Alternating-Time Temporal Logic (ATL , for short) has been introduced as a ...
    • Resource Constrained Loop Fusion 

      Ding, Chen; Kennedy, Ken (2003-09-03)
      Embedded processors have limited on-chip memory. Fusing loops that use the same data can reduce the distance between accesses to the same memory location, avoiding costly off-chip memory transfer. Most existing greedy ...
    • Reticulate evolutionary history and extensive introgression in mosquito species revealed by phylogenetic network analysis 

      Wen, Dingqiao; Yu, Yun; Hahn, Matthew W.; Nakhleh, Luay (2016)
      The role of hybridization and subsequent introgression has been demonstrated in an increasing number of species. Recently, Fontaine et al. (Science, 347, 2015, 1258524) conducted a phylogenomic analysis of six members of ...
    • Robonaut 2 and you: Specifying and executing complex operations 

      Baker, William; Kingston, Zachary; Moll, Mark; Badger, Julia; Kavraki, Lydia (2017)
      Crew time is a precious resource due to the expense of trained human operators in space. Efficient caretaker robots could lessen the manual labor load required by frequent vehicular and life support maintenance tasks, ...
    • Robotics-Based Location Sensing based on Wireless Ethernet 

      Bekris, Kostas E.; Kavraki, Lydia E.; Ladd, Andrew M.; Marceau, Guillaume; Rudys, Algis; Wallach, Dan S. (2002-04-25)
      A key subproblem in the construction of location-aware systems is the determination of the position of a mobile device. This paper describes the design, implementation and analysis of a system for determining position from ...
    • Routing Improvements using Directional Antennas in Mobile Ad hoc Networks 

      Johnson, David B.; Saha, Amit (2003-07-03)
      In this paper, we present the design and evaluation of two techniques for routing improvement using directional antennas in mobile ad-hoc networks. First, we use directional antennas to bridge network partitions by adaptively ...
    • Runtime Support for Distributed Sharing in Strongly-Typed Languages 

      Cox, Alan L.; Hu, Y. Charlie; Wallach, Dan S.; Yu, Weimin; Zwaenepoel, Willy (1999-11-13)
      In this paper, we present a new run-time system for strongly-typed programming languages that supports object sharing in a distributed system. The key insight in this system is that type information allows efficient and ...
    • Saddle points in random matrices: analysis of Knuth search algorithms 

      Hofri, Micha; Jacquet, Philippe (1997-12-22)
      In this note we present an analysis of algorithms for finding saddle points in a random matrix, presented by Donald E. Knuth as exercise 1.3.2-12 in The Art of Computer Programming. We estimate the average computing costs ...
    • Scalability and Data Placement on SGI Origin 

      Chauhan, Arun; Ding, Chen; Sheraw, Berry (1998-04-01)
      Cache-coherent non-uniform memory access (ccNUMA) architectures have attracted lots of academic and industry interests as a promising direction to large scale parallel computing. Data placement has been used as a major ...
    • Scalable and Precise Dynamic Datarace Detection for Structured Parallelism 

      Raman, Raghavan; Zhao, Jisheng; Sarkar, Vivek; Vechev, Martin; Yahav , Eran (2012-07-06)
      Existing dynamic race detectors suffer from at least one of the following three limitations: i) space overhead per memory location grows linearly with the number of parallel threads [13], severely limiting the parallelism ...