@conference {17843,
	title = {Decentralized dynamic scheduling across heterogeneous multi-core desktop grids},
	booktitle = {2010 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum (IPDPSW)},
	year = {2010},
	month = {2010/04/19/23},
	pages = {1 - 9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler.},
	keywords = {backfill jobs, bounded waiting time, Computer science, decentralized dynamic scheduling, desktop grid resource management, Dynamic scheduling, Educational institutions, Environmental management, grid computing, heterogeneous multicore desktop grid, job assignment, job migration, load balancing, Load management, multicore computing environment, Peer to peer computing, Processor scheduling, residual resources, resource allocation, Resource management, scheduling, Scheduling algorithm, Throughput},
	isbn = {978-1-4244-6533-0},
	doi = {10.1109/IPDPSW.2010.5470877},
	author = {Jaehwan Lee and Keleher,P. and Sussman, Alan}
}
@conference {18658,
	title = {Analysis of Computer Security Incident Data Using Time Series Models},
	year = {2008},
	month = {2008/11//},
	pages = {77 - 86},
	abstract = {Organizations face increasing challenges in addressing and preventing computer and network security incidents. There are financial consequences from security incidents. These include lost time and resources used during recovery, possible theft of personal and/or proprietary information, and reputational damage that may negatively impact stock prices or reduce consumer confidence in a company. Being able to understand and predict trends in computer and network security incidents can aid an organization with resource allocation for prevention of such incidents, as well as evaluation of mitigation strategies. We look at using time series models with a large set of security incident data. We examine appropriateness of the data for modeling and consider needed transformations. Parameter search and model selection criteria are discussed. Then, forecasts from time series models are compared to forecasts from Non-Homogeneous Poisson Process (NHPP) software reliability growth (SRG) models.},
	keywords = {Computer networks, computer security incident data, NETWORK SECURITY, resource allocation, security of data, telecommunication security, time series, time series model},
	doi = {10.1109/ISSRE.2008.39},
	author = {Condon,E. and He,A. and Michel Cukier}
}
@conference {17877,
	title = {DiST: fully decentralized indexing for querying distributed multidimensional datasets},
	booktitle = {Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International},
	year = {2006},
	month = {2006/04//},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Grid computing and peer-to-peer (P2P) systems are emerging as new paradigms for managing large scale distributed resources across wide area networks. While grid computing focuses on managing heterogeneous resources and relies on centralized managers for resource and data discovery, P2P systems target scalable, decentralized methods for publishing and searching for data. In large distributed systems, a centralized resource manager is a potential performance bottleneck and decentralization can help avoid this bottleneck, as is done in P2P systems. However, the query functionality provided by most existing P2P systems is very rudimentary, and is not directly applicable to grid resource management. In this paper, we propose a fully decentralized multidimensional indexing structure, called DiST, that operates in a fully distributed environment with no centralized control. In DiST, each data server only acquires information about data on other servers from executing and routing queries. We describe the DiST algorithms for maintaining the decentralized network of data servers, including adding and deleting servers, the query routing algorithm, and failure recovery algorithms. We also evaluate the performance of the decentralized scheme against a more structured hierarchical indexing scheme that we have previously shown to perform well in distributed grid environments},
	keywords = {Computer network management, distributed multidimensional dataset querying, failure recovery, fault tolerant computing, fully decentralized multidimensional indexing, grid computing, Indexing, large scale distributed resource management, Large-scale systems, Multidimensional systems, Network servers, P2P systems, Peer to peer computing, peer-to-peer computing, peer-to-peer systems, Publishing, Query processing, query routing, resource allocation, Resource management, telecommunication network routing, wide area networks},
	isbn = {1-4244-0054-6},
	doi = {10.1109/IPDPS.2006.1639280},
	author = {Nam,Beomseok and Sussman, Alan}
}
@article {15678,
	title = {Class-based access control for distributed video-on-demand systems},
	journal = {IEEE Transactions on Circuits and Systems for Video Technology},
	volume = {15},
	year = {2005},
	month = {2005/07//},
	pages = {844 - 853},
	abstract = {The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.},
	keywords = {Access control, Admission control, Analytical models, blocking performance, class-based access control, Computational modeling, Computer architecture, Computer science, Distributed control, Distributed video-on-demand (VoD) system, distributed video-on-demand system, multimedia systems, multirate service model, Performance analysis, QoS, quality of service, request handling policy, resource allocation, resource capacity, telecommunication congestion control, threshold-based admission control, video on demand},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2005.848351},
	author = {Mundur, Padma and Sood,A. K and Simon,R.}
}
@article {15679,
	title = {End-to-end analysis of distributed video-on-demand systems},
	journal = {IEEE Transactions on Multimedia},
	volume = {6},
	year = {2004},
	month = {2004/02//},
	pages = {129 - 141},
	abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.},
	keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2003.819757},
	author = {Mundur, Padma and Simon,R. and Sood,A. K}
}
@article {14768,
	title = {Resource policing to support fine-grain cycle stealing in networks of workstations},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {15},
	year = {2004},
	month = {2004/10//},
	pages = {878 - 892},
	abstract = {We present the design, implementation, and performance evaluation of a suite of resource policing mechanisms that allow guest processes to efficiently and unobtrusively exploit otherwise idle workstation resources. Unlike traditional policies that harvest cycles only from unused machines, we employ fine-grained cycle stealing to exploit resources even from machines that have active users. We developed a suite of kernel extensions that enable these policies to operate without significantly impacting host processes: 1) a new starvation-level CPU priority for guest jobs, 2) a new page replacement policy that imposes hard bounds on physical memory usage by guest processes, and 3) a new I/O scheduling mechanism called rate windows that throttle guest processes{\textquoteright} usage of I/O and network bandwidth. We evaluate both the individual impacts of each mechanism, and their utility for our fine-grain cycle stealing.},
	keywords = {65, Application software, Bandwidth, cluster computing, Computer networks, Computer Society, Concurrent computing, cycle stealing, cycle stealing., grid computing, I/O scheduling, Intelligent networks, Kernel, network bandwidth, networks of workstations, page replacement policy, parallel computing, performance evaluation, Processor scheduling, resource allocation, resource scheduling, starvation-level CPU priority, workstation clusters, workstation resources, Workstations},
	isbn = {1045-9219},
	doi = {10.1109/TPDS.2004.58},
	author = {Ryu, K. D and Hollingsworth, Jeffrey K}
}
@conference {14817,
	title = {Unobtrusiveness and efficiency in idle cycle stealing for PC grids},
	booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International},
	year = {2004},
	month = {2004/04/26/30},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Summary form only given. Studies have shown that for a significant fraction of the time desktop PCs and workstations are under-utilized. To exploit these idle resources, various desktop/workstation grid systems have been developed. The ultimate goal of such systems is to maximize efficiency of resource usage while maintaining low obtrusiveness to machine owners. To this end, we created a new fine-grain cycle stealing approach and conducted a performance comparison study against the traditional coarse-grain cycle stealing. We developed a prototype of fine-grain cycle stealing, the Linger-Longer system, on a Linux cluster. The experiments on a cluster of desktop Linux PCs with benchmark applications show that, overall, fine-grain cycle stealing can improve efficiency of idle cycle usage by increasing the guest job throughput by 50\% to 70\%, while limiting obtrusiveness with no more than 3\% of host job slowdown.},
	keywords = {Biological system modeling, Computational modeling, Computer science, Computer simulation, Contracts, desktop grid system, fine-grain cycle stealing approach, grid computing, idle cycle stealing, Linger-Longer system, Linux, Linux cluster, microcomputers, PC grids, Personal communication networks, Prototypes, resource allocation, Throughput, workstation clusters, workstation grid systems, Workstations},
	isbn = {0-7695-2132-0},
	doi = {10.1109/IPDPS.2004.1302987},
	author = {Ryu, K. D and Hollingsworth, Jeffrey K}
}
@conference {15429,
	title = {Using transient/persistent errors to develop automated test oracles for event-driven software},
	booktitle = {Automated Software Engineering, 2004. Proceedings. 19th International Conference on},
	year = {2004},
	month = {2004/09//},
	pages = {186 - 195},
	abstract = {Today{\textquoteright}s software-intensive systems contain an important class of software, namely event-driven software (EDS). All EDS take events as input, change their state, and (perhaps) output an event sequence. EDS is typically implemented as a collection of event-handlers designed to respond to individual events. The nature of EDS creates new challenges for test automation. In this paper, we focus on those relevant to automated test oracles. A test oracle is a mechanism that determines whether a software executed correctly for a test case. A test case for an EDS consists of a sequence of events. The test case is executed on the EDS, one event at a time. Errors in the EDS may "appear" and later {\textquotedblright}disappear" at several points (e.g., after an event is executed) during test case execution. Because of the behavior of these transient (those that disappear) and persistent (those that don{\textquoteright}t disappear) errors, EDS require complex and expensive test oracles that compare the expected and actual output multiple times during test case execution. We leverage our previous work to study several applications and observe the occurrence of persistent/transient errors. Our studies show that in practice, a large number of errors in EDS are transient and that there are specific classes of events that lead to transient errors. We use the results of this study to develop a new test oracle that compares the expected and actual output at strategic points during test case execution. We show that the oracle is effective at detecting errors and efficient in terms of resource utilization},
	keywords = {automated test oracles, Automatic testing, event driven software, Graphical user interfaces, persistent errors, program testing, resource allocation, resource utilization, software intensive systems, test case execution, transient errors},
	doi = {10.1109/ASE.2004.1342736},
	author = {Memon, Atif M. and Xie,Qing}
}
@article {18652,
	title = {An adaptive quality of service aware middleware for replicated services},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {14},
	year = {2003},
	month = {2003/11//},
	pages = {1112 - 1125},
	abstract = {A dependable middleware should be able to adaptively share the distributed resources it manages in order to meet diverse application requirements, even when the quality of service (QoS) is degraded due to uncertain variations in load and unanticipated failures. We have addressed this issue in the context of a dependable middleware that adaptively manages replicated servers to deliver a timely and consistent response to time-sensitive client applications. These applications have specific temporal and consistency requirements, and can tolerate a certain degree of relaxed consistency in exchange for better response time. We propose a flexible QoS model that allows clients to specify their timeliness and consistency constraints. We also propose an adaptive framework that dynamically selects replicas to service a client{\textquoteright}s request based on the prediction made by probabilistic models. These models use the feedback from online performance monitoring of the replicas to provide probabilistic guarantees for meeting a client{\textquoteright}s QoS specification. The experimental results we have obtained demonstrate the role of feedback and the efficacy of simple analytical models for adaptively sharing the available replicas among the users under different workload scenarios.},
	keywords = {distributed resource sharing, Middleware, online performance monitoring, probabilistic modeling, QoS specification, quality of service, replica consistency, replicated services, resource allocation, time-sensitive client applications, timeliness constraints},
	isbn = {1045-9219},
	doi = {10.1109/TPDS.2003.1247672},
	author = {Krishnamurthy,Sudha and Sanders,W. H. and Michel Cukier}
}
@conference {15691,
	title = {Integrated admission control in hierarchical video-on-demand systems},
	booktitle = {IEEE International Conference on Multimedia Computing and Systems, 1999},
	volume = {1},
	year = {1999},
	month = {1999/07//},
	pages = {220-225 vol.1 - 220-225 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We develop a unified model of a hierarchical video-on-demand (VoD) system by integrating the storage and the network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking},
	keywords = {Admission control, Bandwidth, blocking, Computer science, Design methodology, end-to-end system, hierarchical video-on-demand systems, integrated admission control, Intelligent networks, Load management, Motion pictures, Network servers, network subsystem, performance, Performance analysis, performance evaluation, quality of service, request handling, resource allocation, Resource management, simulation, storage subsystem, video on demand, video servers},
	isbn = {0-7695-0253-9},
	doi = {10.1109/MMCS.1999.779196},
	author = {Mundur, Padma and Simon,R. and Sood,A.}
}
@conference {14784,
	title = {LBF: a performance metric for program reorganization},
	booktitle = {18th International Conference on Distributed Computing Systems, 1998. Proceedings},
	year = {1998},
	month = {1998/05/26/29},
	pages = {222 - 229},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs},
	keywords = {case study, Computational modeling, computer network, Computer science, Debugging, distributed processing, distributed program, Educational institutions, Integrated circuit testing, LBF metric, load balancing factor, Load management, measurement, NIST, parallel program, parallel programming, performance metric, program reorganization, program tuning, Programming profession, resource allocation, software metrics, software performance evaluation, US Department of Energy},
	isbn = {0-8186-8292-2},
	doi = {10.1109/ICDCS.1998.679505},
	author = {Eom, H. and Hollingsworth, Jeffrey K}
}
