Now showing items 91-110 of 297

    • E-FRP With Priorities 

      Inoue, Jun; Kaiabachev, Roumen; Taha, Walid; Zhu, Angela (2009-07-15)
      E-FRP is declarative language for programming resource-bounded, event-driven systems. Its original high-level semantics requires that each event handler execute atomically. This facilitates reasoning about E-FRP programs, ...
    • Effective Communication Coalescing for Data-Parallel Applications 

      Chavarria-Miranda, Daniel; Mellor-Crummey, John (2005-07-29)
      Communication coalescing is a static optimization that can reduce both communication frequency and redundant data transfer in compiler-generated code for regular, data parallel applications. We present an algorithm for ...
    • Effective Performance Measurement and Analysis of Multithreaded Applications 

      Mellor-Crummey, John; Tallent, Nathan (2008-10-13)
      Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore processors is a problem of growing practical ...
    • Effective Static Debugging via Componential Set-Based Analysis 

      Flanagan, Cormac (1997-08-28)
      Sophisticated software systems are inherently complex. Understanding, debugging and maintaining such systems requires inferring high-level characteristics of the system's behavior from a myriad of low-level details. For ...
    • Efficient Distributed Shared Memory Based on Multi-Protocol Release Consistency 

      Carter, John B. (1994-01)
      A distributed shared memory (DSM) system allows shared memory parallel programs to be executed on distributed memory multiprocessors. The challenge in building a DSM system is to achieve good performance over a wide range ...
    • Efficient Reorganization of Binary Search Trees 

      Hofri, Micha; Shachnai, Hadas (1996-11-13)
      We consider the problem of maintaining a binary search tree that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in which the accesses are generated according to a ...
    • Efficient Selection of Vector Instructions using Dynamic Programming 

      Barik, Rajkishore; Sarkar, Vivek; Zhao, Jisheng (2010-06-17)
      Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scientific, and embedded applications. To take ...
    • Elastic Tasks: Unifying Task Parallelism and SPMD Parallelism with an Adaptive Runtime 

      Agrawal, Kunal; Sarkar, Vivek; Sbîrlea, Alina (2015-02-11)
      In this paper, we introduce elastic tasks, a new high-level parallel programming primitive that can be used to unify task parallelism and SPMD parallelism in a common adaptive scheduling framework. Elastic tasks are ...
    • End-to-End TCP Congestion Control over ATM Networks 

      Aron, Mohit; Druschel, Peter (1997-02-12)
      It is well documented that the effective throughput of TCP can suffer on plain ATM networks. Several research efforts have aimed at developing additions to ATM networks like Early Packet Discard that avoid TCP throughput ...
    • Evaluating a Model for Cache Conflict Miss Prediction 

      Kennedy, Ken; Qasem, Apan (2005-04-10)
      Cache conflict misses can cause severe degradation in application performance. Previous research has shown that for many scientific applications majority of cache misses are due to conflicts in cache. Although, conflicts ...
    • An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data 

      Berestovsky, Natalie; Nakhleh, Luay (2013)
      Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is ...
    • Evolution After Whole-genome Duplication: A Network Perspective 

      Zhu, Yun; Lin, Zhenguo; Nakhleh, Luay (2013)
      Gene duplication plays an important role in the evolution of genomes and interactomes. Elucidating how evolution after gene duplication interplays at the sequence and network level is of great interest. In this paper, we ...
    • Exploiting Internet Delay Space Properties for Sybil Attack Mitigation 

      Ng, T. S. Eugene; Zhang, Bo (2008-06-02)
      Recent studies have discovered that the Internet delay space has many interesting properties such as triangle inequality violations (TIV), clustering structures, and constrained growth. Understanding these properties has ...
    • Exploring the Potential for Accelerating Sparse Matrix-Vector Product on a Processing-in-Memory Architecture 

      Youssefi, Annahita (2008-03-12)
      As the importance of memory access delays on performance has mushroomed over the last few decades, researchers have begun exploring Processing-in-Memory (PIM) technology, which offers higher memory bandwidth, lower memory ...
    • Expressiveness, Programmability and Portable High Performance of Global Address Space Languages 

      Dotsenko, Yuri (2007-01-30)
      The Message Passing Interface (MPI) is the library-based programming model employed by most scalable parallel applications today; however, it is not easy to use. To simplify program development, Partitioned Global Address ...
    • Extensible Adaptation via Constraint Solving 

      Dotsenko, Yuri (2002-04-30)
      This work presents the design, implementation, and evaluation of a simple programming language for expressing scheduling policies for transmission of multiple objects across a shared network connection. A key design component ...
    • Fast Approximating Triangulation of Large Scattered Datasets 

      Warren, Joe; Weimer, Henrik (1997-09-03)
      This report describes algorithms and data-structures for the fast construction of three-dimensional triangulations from large sets of scattered data-points. The triangulations have a guaranteed error bound, i.e. all the ...
    • Finding Solutions of the Inverse Kinematics Problems in Computer-aided Drug Design 

      Kavraki, Lydia E.; Zhang, Ming (2002-01-25)
      The efficient computation of low-energy molecular conformations is of critical importance to problems ranging from protein folding to computer-assisted drug design. Despite the growing number of papers on three-dimensional ...
    • Finding the Evidence in Tamper-Evident Logs 

      Sandler, Daniel; Derr, Kyle; Crosby, Scott A.; Wallach, Dan S. (2008-01-23)
      Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity encoded in these tamper-evident chronological ...
    • Fixpoint Logics, Relational Machines, and Computational Complexity 

      Abiteboul, Serge; Vardi, Moshe Y.; Vianu, Victor (1996-10-11)
      We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1st-order operators (inflationary or noninflationary) and iteration constructs ...