CSE Technical Reports Sorted by Technical Report Number

TR Number Title Authors Date Pages

CSE-TR-227-95 Design and Evaulation of a Window-Consistent Replication Service Mehra Rexford Ang and Jahanian Jan, 95 18

CSE-TR-228-95 Optimization of Mass Storage Hierarchies Jacob Feb, 95 26

CSE-TR-229-95 An Offline Partial Evaluator for Evolving Algebras Huggins Mar, 95 7

CSE-TR-230-95 The Generalized Railroad Crossing Problem: An Evolving Algebra Based Solution Gurevich Huggins and Mani Mar, 95 8

CSE-TR-231-95 Notes on Calculating Computer Performance Jacob and Mudge Mar, 95 10

CSE-TR-232-95 Hierarchical performance Modeling with Cache Effects: A Case Study of the DEC Alpha Wang Mar, 95 31

CSE-TR-233-95 Reliable File Caches Chen Aycock and Rajamani Apr, 95 6

CSE-TR-234-95 A Microeconomic Approach to Intellitent Resource Sharing in Multiagent Systems Lee and Durfee Apr, 95 13

CSE-TR-235-95 Toward a Dynamical Pick and Place Burridge Rizzi and Koditschek May, 95 20

CSE-TR-236-95 Modeling Computation and Communication Performance of Parallel Scientific Applications: A Case Study of the IBM SP2 Boyd Abandah Lee and Davidson May, 95 16

CSE-TR-237-95 A Constraint-based Object Model for Structured Document Management Nica and Rundensteiner May, 95 16

CSE-TR-238-95 Design Tradeoffs in Implementing Real-Time Channels on Bus-Based Multiprocessor Hosts Indiresan Mehra and Shin May, 95 21

CSE-TR-239-95 Tailoring Routing and Switching Schemes to Application Workloads in Multicomputer Networks Feng Rexford Daniel Mehra and Shin May, 95 14

CSE-TR-240-95 Equivalence Is In The Eye Of The Beholder Gurevich and Huggins May, 95 14

CSE-TR-241-95 The Object-Slicing Technique: A Flexible Object-Representation and Its Evaluation Kuno Ra and Rundensteiner May, 95 18

CSE-TR-242-95 Collected Papers of the Soar/IFOR Project Spring 1995 Johnson Jones Koss Laird et. al. Jun, 95 72

CSE-TR-243-95 System-Oriented Evaluation of I/O Subsystem Performance Ganger Jun, 95 133

CSE-TR-244-95 Aggressive Centralized and Distributed Scheduling of Disk Requests Worthington Jun, 95 208

CSE-TR-245-95 Hierarchical Testing Using Precomputed Tests for Modules Murray Jun, 95 210

CSE-TR-246-95 The MultiView OODB ViewSystem: Design and Implementation Kuno and Rundensteiner Jun, 95 29

CSE-TR-247-95 Loop Optimization Techniques on Multi-Issue Architectures Kaiser Jun, 95 183

CSE-TR-248-95 Multiagent Negotiation Framework (A preliminary report) Park and Birmingham Jun, 95 17

CSE-TR-249-95 Specification and Verification of the Undo/Redo Algorithm for Database Recovery Gurevich and Wallace Jul, 95 18

CSE-TR-250-95 Rio: Storing Files Reliably in Memory Chen Aycock Ng Rajamani and Sivaramakrishnan Jul, 95 9

CSE-TR-251-95 An Object Model and Algebra for the Implicit Unfolding of Hierarchical Structures Jones and Rundensteiner Jul, 95 19

CSE-TR-252-95 Using Object-Oriented Principles to Optimize Update Propagation to Materialized Views Kuno and Rundensteiner Jul, 95 26

CSE-TR-253-95 Dynamic Modeling of Logic Gate Circuits Sakallah Jul, 95 18

CSE-TR-254-95 Soft Updates: A Solution to the Metadata Update Problem in File Systems Ganger and Patt Aug, 95 44

CSE-TR-255-95 Functional Abstractions and Partial Specification of Boolean Functions Sakallah Aug, 95 18
We define functional abstraction as the process of deliberately ignoring the dependence of a Boolean function on a subset of its variables. Functional abstraction causes a completely specified function to become partially specified. We propose functions sets as a theoretical model for partially specified functions and function intervals as a practical approximation to them. We develop an interval Boolean algebra suitable for the symbolic manipulation of function intervals and highlight the relationship between functional abstraction and universal and existential quantification.

CSE-TR-256-95 Automatic Generation of Performance Bounds on the KSR1 Lee and Davidson Aug, 95 44

CSE-TR-257-95 Timing Analysis of Digital Systems with Gated Clocks VanCampenhout and Mudge Aug, 95 11

CSE-TR-258-95 Modeling the Communication and Computation Performance of the IBM SP2 Abandah May, 95 62

CSE-TR-259-95 Hierarchical Concurrent Engineering: Supporting Hierarchical Decomposition and Peer-to-Peer Problem Solving D'Ambrosio and Birmingham Sep, 95 33

CSE-TR-260-95 An Optimal Bandwidth Allocation Strategy for the Delivery of Compressed Prerecorded Video Feng Jahanian and Sechrest Sep, 95 20

CSE-TR-261-95 Optimal Dual-Issue Instruction Scheduling with Spills For Binary Expression Trees Meleis and Davidson Oct, 95 14

CSE-TR-262-95 Modeling the Effects of Temporal Proximity of Input Transitions on Gate Propagation Delay and Transition Time Chandramouli and Sakallah Oct, 95 17
While delay modeling of gates with a single switching input has received a lot of attention, the case of multiple inputs switching in close temporal proximity is just beginning to be addressed in the literature. The effect of proximity of input transitions can be significant on the delay and output transition time. The few attempts that have addressed this issue are based on a series-parallel transistor collapsing method that reduces the multi-input gate to an inverter. This limits the technique to CMOS technology. Moreover, none of them discuss the appropriate choice of voltage thresholds to measure delay for a multi-input gate. In this paper, we first present a method for the choice of voltage thresholds for a multi-input gate that ensures a positive value of delay for any combination of input transition times and the temporal separations among them. We next introduce a dual-input proximity model for the case when only two inputs of the gate are switching. We then prose a simple algorithm for calculating the delay and output transition time that makes repeated use of the dual-input proximity model and that does not collapse the gate into a equivalent inverter. Comparison with simulation results shows that our method performs quite well in practice. Before concluding the paper we also show the close relationship between the inertial delay of a gate and the proximity of input transitions.

CSE-TR-263-95 Automatic Parallel Program Conversion from Shared-Memory to Message-Passing Lee and Davidson Oct, 95 15

CSE-TR-264-95 A Comparison of Genetic Algorithms and Other Machine Learning Systems of a Complex Classification Task from Common Disease Research Congdon Oct, 95 168

CSE-TR-265-95 Real-Time Concurrency Control in Groupware Jensen and Soparkar Oct, 95 21

CSE-TR-266-95 A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints Eichenberger and Davidson Oct, 95 14

CSE-TR-267-95 Event Propagation Conditions in Timing Analysis Yalcin and Hayes Nov, 95 12

CSE-TR-268-95 A Simplified Model of a Supercritical Power Plant Shinohara and Koditschek Sep, 95 37

CSE-TR-269-95 Monitoring and Assertion-Checking of Real Time Specifications in Modechart Brockmeyer and Jahanian Oct, 95 31

CSE-TR-270-95 The Publish/Subscribe Paradigm for Scalable Group Collaboration Systems Mathur Hall Jahanian Prakash and Rasmussen Nov, 95 16

CSE-TR-271-95 Providing VCR Functionality in a Constant Quality Video-On-Demand Transportation Service Feng Jahanian and Sechrest Dec, 95 20

CSE-TR-272-95 Interactive Visualizations for Temporal Analysis: Application to CSCW Multimedia Data Hibino and Rundensteiner Dec, 95 19

CSE-TR-273-95 Measuring and Improving Memory's Resistance to Operating System Crashes Ng Rajamani Aycock and Chen Dec, 95 12

CSE-TR-274-95 A Protocol Composition-Based Approach to QoS Control in Collaboration Systems Mathur and Prakash Dec, 95 20

CSE-TR-275-95 Protocols for Authenticated Download to Mobile Information Appliances Jaeger and Rubin Dec, 95 12

Technical Reports Page