Search For:

Displaying 1-18 out of 18 total
Partial Program Admission
Found in: Real-Time and Embedded Technology and Applications Symposium, IEEE
By Michael Wilson, Ron Cytron, Jonathan Turner
Issue Date:April 2009
pp. 295-304
Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statica...
 
Understanding the performance of streaming applications deployed on hybrid systems
Found in: Parallel and Distributed Processing Symposium, International
By Joseph Lancaster, Ron Cytron, Roger D. Chamberlain
Issue Date:April 2008
pp. 1-5
Significant performance gains have been reported by exploiting the specialized characteristics of hybrid computing architectures for a number of streaming applications. While it is straightforward to physically construct these hybrid systems, application d...
 
Middleware Specialization for Memory-Constrained Networked Embedded Systems
Found in: Real-Time and Embedded Technology and Applications Symposium, IEEE
By Venkita Subramonian, Guoliang Xing, Christopher Gill, Chenyang Lu, Ron Cytron
Issue Date:May 2004
pp. 306
General purpose middleware has been shown to be effective off-the-shelf, in meeting diverse functional requirements for a wide range of distributed systems. However, middleware customization is necessary for many networked embedded systems because of the r...
 
Middleware Scheduling Optimization Techniques for Distributed Real-Time and Embedded Systems
Found in: Object-Oriented Real-Time Dependable Systems, IEEE International Workshop on
By Christopher Gill, Ron Cytron, Douglas Schmidt
Issue Date:January 2002
pp. 0311
No summary available.
 
Formalizing Meta-Programming Techniques to Reconcile Heterogeneous Scheduling Disciplines in Open Distributed Real-Time Systems
Found in: Distributed Objects and Applications, International Symposium on
By Angelo Corsaro, Chris Gill, Ron Cytron, Douglas C. Schmidt
Issue Date:September 2001
pp. 0289
Abstract: In open distributed real-time and embedded (DRE) systems, different ORB endsystems may use different scheduling disciplines. To ensure appropriate end-to-end application behavior in an open architecture, DRE systems must enforce an ordering on ac...
 
Evaluating and Optimizing Thread Pool Strategies for Real-Time CORBA
Found in: Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems (OM '01)
By Douglas C. Schmidt, Irfan Pyarali, Marina Spivak, Ron Cytron
Issue Date:August 2001
pp. 296-306
Strict control over the scheduling and execution of processor resources is essential for many fixed-priority real-time applications. To facilitate this common requirement, the Real-Time CORBA (RT-CORBA) specification defines standard middleware features th...
     
Designing and Optimizing a Scalable CORBA Notification Service
Found in: Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems (OM '01)
By Carlos O'Ryan, Douglas Schmidt, Pradeep Gore, Ron Cytron
Issue Date:August 2001
pp. 296-306
Many distributed applications require a scalable event-driven communication model that decouples suppliers from consumers and simultaneously supports advanced quality of service (QoS) properties and event filtering mechanisms. The CORBA Notification Servic...
     
Evaluating and Optimizing Thread Pool Strategies for Real-Time CORBA
Found in: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (LCTES '01)
By Douglas C. Schmidt, Irfan Pyarali, Marina Spivak, Ron Cytron
Issue Date:August 2001
pp. 694-699
Strict control over the scheduling and execution of processor resources is essential for many fixed-priority real-time applications. To facilitate this common requirement, the Real-Time CORBA (RT-CORBA) specification defines standard middleware features th...
     
Designing and Optimizing a Scalable CORBA Notification Service
Found in: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (LCTES '01)
By Carlos O'Ryan, Douglas Schmidt, Pradeep Gore, Ron Cytron
Issue Date:August 2001
pp. 694-699
Many distributed applications require a scalable event-driven communication model that decouples suppliers from consumers and simultaneously supports advanced quality of service (QoS) properties and event filtering mechanisms. The CORBA Notification Servic...
     
Summary of the Dynamo '00 panel discussion (Panel Session)
Found in: Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization (DYNAMO '00)
By Michael J. Voss, Ron Cytron, Yoo C. Chung
Issue Date:January 2000
pp. 157
Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems r...
     
Dynamic compilation in Jalapeño (Panel Session)
Found in: Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization (DYNAMO '00)
By Ron Cytron, Vivek Sarkar
Issue Date:January 2000
pp. 157
Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems r...
     
Tempo, a program specializer for C (Panel Session)
Found in: Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization (DYNAMO '00)
By Renaud Marlet, Ron Cytron
Issue Date:January 2000
pp. 157
Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems r...
     
Dynamo (Panel Session): a transparent, dynamic, native binary optimizer
Found in: Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization (DYNAMO '00)
By Ron Cytron, Vasanth Bala
Issue Date:January 2000
pp. 157
Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems r...
     
Efficient accommodation of may-alias information in SSA form
Found in: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation (PLDI '93)
By Reid Gershbein, Ron Cytron
Issue Date:June 1993
pp. 329-338
We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our met...
     
Automatic discovery of parallelism: a tool and an experiment (extended abstract)
Found in: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (PPEALS '88)
By David Shields, Jeanne Ferrante, Michael Burke, Ron Cytron, Vivek Sarkar, Wilson Hsieh
Issue Date:July 1988
pp. 201-211
This paper reports preliminary results from applying advanced techniques to the parallelization of sequential programs. Such techniques include interprocedural analysis and the identification of nested parallelism. These techniques have been proposed for e...
     
Efficiently computing static single assignment form and the control dependence graph
Found in: ACM Transactions on Programming Languages and Systems (TOPLAS)
By Barry K. Rosen, F. Kenneth Zadeck, Jeanne Ferrante, Mark N. Wegman, Ron Cytron
Issue Date:January 1988
pp. 451-490
A collecting interpretation of expressions is an interpretation of a program that allows one to answer questions of the sort: “What are all possible values to which an expression might evaluate during program execution?” Answering such question...
     
Interprocedural dependence analysis and parallelization
Found in: Proceedings of the 1986 SIGPLAN symposium on Compiler contruction (SIGPLAN '86)
By Michael Burke, Ron Cytron
Issue Date:June 1986
pp. 1160-1164
We present a method that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures. The method is more efficient than existing methods: we reduce many tests, performed separately by existing methods, to a sin...
     
Code motion of control structures in high-level languages
Found in: Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL '86)
By Andy Lowry, F. Kenneth Zadeck, Ron Cytron
Issue Date:January 1986
pp. 70-85
We show that tree pattern matching has significant advantages in the specification and implementation of efficient code generators. We present a top-down tree-matching algorithm that is particularly well suited to code generation applications. Finally, we ...
     
 1