Table of Contents

• Modeling and improving data cache reliabilityIsmail Kadayif, Mahmut T. Kandemir. 1-12 [doi]
• pClock: an arrival curve based approach for QoS guarantees in shared storage systemsAjay Gulati, Arif Merchant, Peter J. Varman. 13-24 [doi]
• QoS policies and architecture for cache/memory in CMP platformsRavi R. Iyer, Li Zhao, Fei Guo, Ramesh Illikkal, Srihari Makineni, Donald Newell, Yan Solihin, Lisa R. Hsu, Steven K. Reinhardt. 25-36 [doi]
• Modeling the relative fitness of storageMichael P. Mesnier, Matthew Wachs, Raja R. Sambasivan, Alice X. Zheng, Gregory R. Ganger. 37-48 [doi]
• Facilitating focused internet measurementsZhihua Wen, Sipat Triukose, Michael Rabinovich. 49-60 [doi]
• Diagnosing network disruptions with network-wide analysisYiyi Huang, Nick Feamster, Anukool Lakhina, Jim (Jun) Xu. 61-72 [doi]
• Understanding network delay changes caused by routing eventsHimabindu Pucha, Ying Zhang, Zhuoqing Morley Mao, Y. Charlie Hu. 73-84 [doi]
• Two-phase routing, scheduling and power control for wireless mesh networks with variable trafficAbhishek Kashyap, Sudipta Sengupta, Randeep Bhatia, Murali S. Kodialam. 85-96 [doi]
• A machine learning approach to TCP throughput predictionMariyam Mirza, Joel Sommers, Paul Barford, Xiaojin Zhu. 97-108 [doi]
• Sensitivity of PCA for traffic anomaly detectionHaakon Ringberg, Augustin Soule, Jennifer Rexford, Christophe Diot. 109-120 [doi]
• Backbone construction in selfish wireless networksSeungjoon Lee, Dave Levin, Vijay Gopalakrishnan, Bobby Bhattacharjee. 121-132 [doi]
• Scalability of fork/join queueing networks with blockingCathy H. Xia, Zhen Liu, Donald F. Towsley, Marc Lelarge. 133-144 [doi]
• Optimizing system configurations quickly by guessing at the performanceTakayuki Osogami, Sei Kato. 145-156 [doi]
• Sizing sketches: a rank-based analysis for similarity searchZhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li. 157-168 [doi]
• Managing energy-performance tradeoffs for multithreaded applications on multiprocessor architecturesSoyeon Park, Weihang Jiang, Yuanyuan Zhou, Sarita V. Adve. 169-180 [doi]
• An algorithm for approximate counting using limited memory resourcesAndrej Cvetkovski. 181-190 [doi]
• Synthetic designs: a new form of true experimental design for use in information systems developmentEric S. Lee, Thomas Whalen. 191-202 [doi]
• PBS: a unified priority-based schedulerHanhua Feng, Vishal Misra, Dan Rubenstein. 203-214 [doi]
• Adaptive and scalable comparison schedulingPredrag R. Jelenkovic, Xiaozhu Kang, Jian Tan. 215-226 [doi]
• Optimal capacity planning in stochastic loss networks with time-varying workloadsSandeep Bhadra, Yingdong Lu, Mark S. Squillante. 227-238 [doi]
• Flow-level stability of data networks with non-convex and time-varying rate regionsJiaping Liu, Alexandre Proutiére, Yung Yi, Mung Chiang, H. Vincent Poor. 239-250 [doi]
• Future directions in performance evaluation researchEvgenia Smirni, Frederica Darema, Albert G. Greenberg, Adolfy Hoisie, Donald F. Towsley. 251-252 [doi]
• Wire speed packet classification without tcams: a few more registers (and a bit of logic) are enoughQunfeng Dong, Suman Banerjee, Jia Wang, Dheeraj Agrawal. 253-264 [doi]
• Data layouts for object-oriented programsMartin Hirzel. 265-276 [doi]
• Building high accuracy bloom filters using partitioned hashingFang Hao, Murali S. Kodialam, T. V. Lakshman. 277-288 [doi]
• An analysis of latent sector errors in disk drivesLakshmi N. Bairavasundaram, Garth R. Goodson, Shankar Pasupathy, Jiri Schindler. 289-300 [doi]
• Clustering and sharing incentives in BitTorrent systemsArnaud Legout, Nikitas Liogkas, Eddie Kohler, Lixia Zhang. 301-312 [doi]
• Distributed link scheduling with constant overheadSujay Sanghavi, Loc Bui, R. Srikant. 313-324 [doi]
• Theoretical bounds on control-plane self-monitoring in routing protocolsRaj Kumar Rajendran, Vishal Misra, Dan Rubenstein. 325-336 [doi]
• Oblivious routing for fat-tree based system area networks with uncertain traffic demandsXin Yuan, Wickus Nienaber, Zhenhai Duan, Rami G. Melhem. 337-348 [doi]
• Evaluating SIP server performanceErich M. Nahum, John M. Tracey, Charles P. Wright. 349-350 [doi]
• Pipeline spectroscopyThomas R. Puzak, Allan Hartstein, Viji Srinivasan, Philip G. Emma, Arthur Nadas. 351-352 [doi]
• Bottom-k sketches: better and more efficient estimation of aggregatesEdith Cohen, Haim Kaplan. 353-354 [doi]
• GRE encapsulated multicast probing: a scalable technique for measuring one-way lossYu Gu, Lee Breslau, Nick G. Duffield, Subhabrata Sen. 355-356 [doi]
• When is service really denied?: a user-centric dos metricJelena Mirkovic, Alefiya Hussain, Brett Wilson, Sonia Fahmy, Wei-Min Yao, Peter L. Reiher, Stephen Schwab, Roshan K. Thomas. 357-358 [doi]
• Does internet media traffic really follow Zipf-like distribution?Lei Guo, Enhua Tan, Songqing Chen, Zhen Xiao, Xiaodong Zhang. 359-360 [doi]
• Comparative characterization of SPEC CPU2000 and CPU2006 on Itanium architectureArun Kejariwal, Gerolf Hoflehner, Darshan Desai, Daniel M. Lavery, Alexandru Nicolau, Alexander V. Veidenbaum. 361-362 [doi]
• Power reduction through measurement and modeling of users and CPUs: summaryBin Lin, Arindam Mallik, Peter A. Dinda, Gokhan Memik, Robert P. Dick. 363-364 [doi]
• Generating representative ISP topologies from first-principlesChong Wang, John W. Byers. 365-366 [doi]
• Bounding damage from link destruction, with application to the internetGeorge Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg. 367-368 [doi]
• Semi-supervised network traffic classificationJeffrey Erman, Anirban Mahanti, Martin F. Arlitt, Ira Cohen, Carey L. Williamson. 369-370 [doi]
• Efficient management of idleness in systemsNingfang Mi, Alma Riska, Qi Zhang, Evgenia Smirni, Erik Riedel. 371-372 [doi]
• Asynchronous iterative solution for state-based performance metricsDouglas V. de Jager, Jeremy T. Bradley. 373-374 [doi]
• Analyzing commercial processor performance numbers for predicting performance of applications of interestKenneth Hoste, Lieven Eeckhout, Hendrik Blockeel. 375-376 [doi]
• BRADO: scalable streaming through reconfigurable treesJiayue He, Augustin Chaintreau. 377-378 [doi]
• QBETS: queue bounds estimation from time seriesDaniel Nurmi, John Brevik, Richard Wolski. 379-380 [doi]
• Pong: diagnosing spatio-temporal internet congestion propertiesLeiwen Deng, Aleksandar Kuzmanovic. 381-382 [doi]
• Mean delay optimization for the M/G/1 queue with pareto type service timesSamuli Aalto, Urtzi Ayesta. 383-384 [doi]