具有惩罚功能的可信机制研究  

Research on a Truthful Mechanism with Penalty

作　　者：刘端阳[1] 徐卫[1] 

机构地区：[1]浙江工业大学信息工程学院,浙江杭州310032

出　　处：《计算机工程与科学》2008年第8期116-119,共4页Computer Engineering & Science

基　　金：浙江省省自然科学基金资助项目(Y105109;Y105118);浙江省教育厅项目(20051397)

摘　　要：网格计算是一项新的分布式计算技术,它可以把分散的各种互联网资源集成为一个统一的平台,实现组织间的资源共享和协作。在实际环境中,网格作业调度必须考虑各个独立、自治组织的个体利益。针对这个问题,本文描述了一种适用于可信机制运作的网格体系结构,并阐述了它的功能组件,同时提出了具有惩罚功能的可信机制,并通过模拟实验证明了算法的有效性。Grid computing is a new distributed-computing technology over the Internet. It integrates all kinds of resources over the Internet into a uniform platform for computing, and realizes resource sharing and collaboration between organizations. In practice, task scheduling in grids has to handle the self-interests of individual organizations that are independent and autonomous. In order to solve this problem, this paper describes an architecture for truthful mechanisms, demonstrates the detailed functions of each component. At the same time, a truthful mechanism with penalty is presented. And a simulation is studied to verify the effectiveness of this truthful mechanism.

关 键 词：网格 机制 可信 惩罚 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]