UTSA CS 6553 Performance Evaluation Notes
CS 6553 Performance Evaluation Notes: Sigmetrics 2002 papers
ACM Sigmetrics 2002 Papers
- PC based precision timing without GPS
- Maximum likelihood network topology identification from edge-based unicast measurements
- Network tomography on general topologies
- LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance
- Modeling and analysis of dynamic coscheduling in parallel and distributed environments
- Analysis of methods for scheduling low priority disk drive tasks
- Symbiotic jobscheduling with priorities for a simultaneous multithreading processor
- Passage time distributions in large Markov chains
- Exact aggregate solutions for M/G/1-type Markov processes
- Scalability of multicast delivery for non-sequential streaming access
- Full-system timing-first simulation
- Performance prediction for random write reductions: a case study in modeling shared memory programs
- Characterizing the d-TLB behavior of SPEC CPU2000 benchmarks
- Error-free garbage collection traces: how to cheat and not get caught
- High-density model for server allocation and placement
- Inferring client response time at the web server
- Admission control and dynamic adaptation for a proportional-delay diffserv-enabled web server
- Quality of service evaluations of multicast streaming protocols
- Characterizing user behavior and network performance in a public wireless LAN
- Energy consumption of TCP Reno, Newreno, and SACK in multi-hop wireless networks
- Improving cluster availability using workstation validation
- Limits of wide-area thin-client computing
- Dynamic statistical profiling of communication activity in distributed applications
ACM Sigmetrics 2003 Papers
Links for the 2003 papers will appear here shortly
- DiST: a simple, reliable and scalable method to significantly reduce processor architecture simulation time
- A framework for modeling and optimization of prescient instruction prefetch
- Queueing systems with long-range dependent input process and subexponential service times
- An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals
- Modeling, simulation and measurements of queuing delay under long-tail internet traffic
- A hybrid systems modeling framework for fast and accurate simulation of data communication network
- Modeling the throughput of TCP Vegas
- Maximum and asymptotic UDP throughput under CHOKe
- Fluid models and solutions for large-scale IP networks
- Resilient multicast using overlays
- Incrementally improving lookup latency in distributed hash table systems
- Measuring the effects of internet path faults on reactive routing
- Internet intrusions: global characteristics and prevalence
- Conductance and congestion in power law graphs
- Run-time modeling and estimation of operating system power consumption
- Effects of clock resolution on the scheduling of interactive and soft real-time processes
- Analysis of cycle stealing with switching cost
- A recursive random search algorithm for large-scale network parameter configuration
- Fast accurate computation of large-scale IP traffic matrices from link loads
- Analysis of LAS scheduling for job size distributions with high variance
- Fairness and efficiency in web server protocols
- Classifying scheduling policies with respect to unfairness in an M/GI/1
- Estimating membership in a multicast session
- Efficient implementation of a statistics counter architecture
- Data cache locking for higher program predictability
- Effect of node size on the performance of cache-conscious B+-tree