@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}
}
@article {19298,
	title = {Signal Processing on Platforms with Multiple Cores: Part 2-Applications and Design [From the Guest Editors]},
	journal = {IEEE Signal Processing Magazine},
	volume = {27},
	year = {2010},
	month = {2010},
	pages = {20 - 21},
	abstract = {Platforms with multiple cores are now prevalent everywhere from desktops and graphics processors to laptops and embedded systems. By adding more parallel computational resources while managing power consumption, multicore platforms offer better programmability, performance, and power efficiency. Signal processing systems of tomorrow will be and must be implemented on platforms with multiple cores. Writing efficient parallel applications that utilize the computing capability of many processing cores require some effort. Signal processing algorithm designers must understand the nuances of a multicore computing engine; only then can the tremendous computing power that such platforms provide be harnessed efficiently. To give a thorough perspective of the area, we have organized two special issues on this topic.},
	keywords = {Concurrent computing, Embedded system, Energy management, Graphics, Multicore processing, Portable computers, Resource management, Signal design, Signal processing, Signal processing algorithms},
	isbn = {1053-5888},
	author = {Chen,Y. and Chakrabarti,C. and Bhattacharyya, Shuvra S. and Bougard, B.}
}
@conference {15694,
	title = {Immunity-Based Epidemic Routing in Intermittent Networks},
	booktitle = {5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON {\textquoteright}08},
	year = {2008},
	month = {2008/06/16/20},
	pages = {609 - 611},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this research, we propose to modify and extend epidemic routing used in intermittent networks. In particular, we propose to include immunity-based information disseminated in the reverse once messages get delivered to their destination. The goal is to design a more efficient routing protocol in terms of resource utilization. The idea is to analyze and evaluate the network performance using an immunity scheme in the context of epidemic routing and its variants. The reverse dissemination of such information requires minimal resources and the tradeoff in timely purging of delivered messages can be significant. We are using ns2 to implement a detailed simulation of the proposed immunity-based epidemic routing.},
	keywords = {Analytical models, Delay, delivered messages, Disruption tolerant networking, Educational institutions, immunity-based epidemic routing, information dissemination, intermittent networks, Mobile ad hoc networks, Network topology, Performance analysis, Resource management, resource utilization, routing protocol, routing protocols, telecommunication network topology},
	isbn = {978-1-4244-1777-3},
	doi = {10.1109/SAHCN.2008.86},
	author = {Mundur, Padma and Seligman,M. and Jin Na Lee}
}
@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 {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}
}
@conference {12381,
	title = {Exploring the probabilistic design space of multimedia systems},
	booktitle = {14th IEEE International Workshop on Rapid Systems Prototyping, 2003. Proceedings},
	year = {2003},
	month = {2003/06/09/11},
	pages = {233 - 240},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we propose the novel concept of probabilistic design for multimedia systems and a methodology to quickly explore such design space at an early design stage. The probabilistic design is motivated by the challenge of how to design, but not over-design, multimedia embedded systems while systematically incorporating such application{\textquoteright}s performance requirements, uncertainties in execution time, and tolerance for reasonable execution failures. Our goal is to bridge the gap between real-time analysis and embedded software implementation for rapid and economic (multimedia) system prototyping. Our method takes advantage of multimedia system{\textquoteright}s unique features mentioned above to relax the rigid hardware requirements for software implementation and eventually avoid over-designing the system.},
	keywords = {economic system prototyping, embedded software implementation, Embedded system, Energy consumption, execution time uncertainties, Hardware, multimedia embedded systems, multimedia system prototyping, multimedia systems, performance requirements, probabilistic design space, rapid system prototyping, Real time systems, real-time analysis, reasonable execution failure tolerance, Resource management, software prototyping, Space exploration, Streaming media, systems analysis, Timing, Uncertainty},
	isbn = {0-7695-1943-1},
	doi = {10.1109/IWRSP.2003.1207053},
	author = {Shaoxiong Hua and Gang Qu and Bhattacharyya, Shuvra S.}
}
@conference {14725,
	title = {Practical programmable packets},
	booktitle = {IEEE INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {1},
	year = {2001},
	month = {2001///},
	pages = {41-50 vol.1 - 41-50 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present SNAP (safe and nimble active packets), a new scheme for programmable (or active) packets centered around a new low-level packet language. Unlike previous active packet approaches, SNAP is practical: namely, adding significant flexibility over IP without compromising safety and security or efficiency. In this paper we show how to compile from the well-known active picket language PLAN to SNAP, showing that SNAP retains PLAN{\textquoteright}s flexibility; give proof sketches of its novel approach to resource control; and present experimental data showing SNAP attains performance very close to that of a software IP router},
	keywords = {active picket language, Application software, complier, Contracts, Data security, efficiency, Explosives, INFORMATION SCIENCE, Internet, IP, IP networks, low-level packet language, packet switching, performance, PLAN, practical programmable packets, program compilers, Protection, resource control, Resource management, safe and nimble active packets, Safety, Security, SNAP, software IP router, Software performance, telecommunication security, Transport protocols},
	isbn = {0-7803-7016-3},
	doi = {10.1109/INFCOM.2001.916685},
	author = {Moore,J. T and Hicks, Michael W. and Nettles,S.}
}
@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.}
}
