Collective value QoS: a performance measure framework for distributed heterogeneous networks

2 Abstract When users' tasks in a distributed heterogeneous computing environment are allocated resources, and the total demand placed on system resources by the tasks, for a given interval of time, exceeds the resources available, some tasks will receive degraded service, receive no service at all, or may be dropped from the system. One part of a

[1]  Chenxi Wang,et al.  A FRAMEWORK FOR SECURITY MEASUREMENT , 1997 .

[2]  Viktor K. Prasanna,et al.  A QoS performance measure framework for distributed heterogeneous networks , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.

[3]  A. Rubinstein,et al.  A Course in Game Theory , 1995 .

[4]  Muthucumaru Maheswaran,et al.  Quality of Service Driven Resource Management Algorithms for Network Computing , 1999, PDPTA.

[5]  Howard Jay Siegel,et al.  Performance Measures for Evaluating Algorithms for SIMD Machines , 1982, IEEE Transactions on Software Engineering.

[6]  Daniel P. Siewiorek,et al.  On quality of service optimization with discrete QoS options , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[7]  Michael P. Wellman,et al.  Some economics of market-based distributed scheduling , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[8]  Cynthia E. Irvine,et al.  Toward quality of security service in a resource management system benefit function , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[9]  Thomas F. Lawrence,et al.  Taxonomy for QoS specifications , 1997, Proceedings Third International Workshop on Object-Oriented Real-Time Dependable Systems.

[10]  Dan C. Marinescu A protocol for multiple access communication with real-time delivery constraints , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[12]  Joan Feigenbaum,et al.  Decentralized trust management , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[13]  Charles Lynn,et al.  Security policy specification language , 1998 .

[14]  Daniel F. Sterne,et al.  Practical Domain and Type Enforcement for UNIX , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[15]  Cynthia E. Irvine,et al.  Toward a taxonomy and costing method for security services , 1999, Proceedings 15th Annual Computer Security Applications Conference (ACSAC'99).

[16]  Binoy Ravindran,et al.  DynBench: A Dynamic Benchmark Suite for Distributed Real-Time Systems , 1999, IPPS/SPDP Workshops.

[17]  Daniel P. Siewiorek,et al.  A resource allocation model for QoS management , 1997, Proceedings Real-Time Systems Symposium.

[18]  Howard Jay Siegel,et al.  Heterogeneous Distributed Computing , 1999 .

[19]  K. Schwan,et al.  Dynamic authentication for high-performance networked applications , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[20]  Downing StreetCambridge Pricing Priority Classes in a Diierentiated Services Network , 1999 .

[21]  Howard Jay Siegel,et al.  A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network , 2000, IEEE Trans. Parallel Distributed Syst..

[22]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[23]  C. Manolakisy An Intelligent Agent for Optimizing Qos-for-money in Priced Abr Connections , 1998 .

[24]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[25]  A. A. Maciejewski,et al.  Heterogeneous Computing , 2002 .

[26]  Matt W. Mutka,et al.  Priority based real-time communication for large scale wormhole networks , 1994, Proceedings of 8th International Parallel Processing Symposium.

[27]  Michael W. Godfrey,et al.  An overview of MSHN: the Management System for Heterogeneous Networks , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[28]  John P Kresho Quality Network Load Information Improves Performance of Adaptive Applications , 1997 .

[29]  Tatyana Ryutov,et al.  Access Control Framework for Distributed Applications , 2000 .

[30]  Daniel P. Siewiorek,et al.  A scalable solution to the multi-resource QoS problem , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[31]  John K. Antonio,et al.  Is an alligator better than an armadillo? [interconnection networks] , 1997, IEEE Concurrency.

[32]  Young-Kuk Kim,et al.  Efficiently supporting hard/soft deadline transactions in real-time database systems , 1996, Proceedings of 3rd International Workshop on Real-Time Computing Systems and Applications.

[33]  John K. Antonio,et al.  Is an Alligator Better Than an Armadillo , 1997 .

[34]  Marco Spuri,et al.  Terminology and Assumptions , 1998 .

[35]  Chaplin,et al.  Quality of Security Service in a Resource Management System Benefit Function Report Documentation Page , .

[36]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Scalable Comput. Pract. Exp..

[37]  Heonshik Shin,et al.  Optimistic priority-based concurrency control protocol for firm real-time database systems , 1994, Inf. Softw. Technol..