oalib

OALib Journal期刊

ISSN: 2333-9721

费用:99美元

投稿

时间不限

2016 ( 129 )

2015 ( 3912 )

2014 ( 4021 )

2013 ( 4185 )

自定义范围…

匹配条件: “曾国荪” ,找到相关结果约72565条。
列表显示的所有文章,均可免费获取
第1页/共72565条
每页显示
一种基于条件pi演算的组合服务柔性演化模型
刘涛,
计算机科学 , 2011,
Abstract: 组合服务应当具有适应所处环境和商业规则不断变化的能力。现有的服务组合语言和执行机制缺乏应对动态变化所需的可变性和适应性。尽管已有很多扩展,但是组合服务的动态适应正确性还缺乏保障。提出了一种基于条件pi演算的组合服务柔性演化机制。通过增加归属操作符和条件控制符对经典pi演算进行扩展,使之与事件一条件一动作模式更好地结合起来,从而提出了一种描述组合服务流程的方法。从分析组合服务各种变化的场景出发,提出了11种基本的变化场景及其不同的柔性演化模式,对每种模式进行了形式化描述和分析。该方法能够保证组合服务的可变性和适应正确性。
云环境下周期和非周期混合实时任务双容错调度算法
曹洁,
计算机应用 , 2015,
Abstract: ?云环境中的处理机故障已成为云计算不可忽视的问题,容错成为设计和发展云计算系统的关键需求。针对一些容错调度算法在任务调度过程中调度效率低下以及任务类型单一的问题,提出一种处理机和任务主副版本分组的容错调度方法;并给出了副版本可重叠执行的判定方法,以及任务最坏响应时间的计算公式。通过实验和分析表明,和以前算法相比,将处理机分成两组分别执行任务主版本和任务副版本,减少了任务调度所需进行可调度测试的时间,增加了副版本重叠执行的机会,减少了所需的处理机个数,对提高系统处理机的利用率和容错调度的效率具有重要的意义。
云计算环境下聚合服务的随机模型检测
钮 俊,
计算机科学 , 2012,
Abstract: 当前缺乏对聚合云服务正确性、响应时间和费用约束统一进行验证的有效方法。扩展基本工作流模式,增强概率、随机、不确定选择的刻画能力,用于定义聚合云服务的服务流程,将流程定义转换为连续时间markov回报过程,扩展连续随机回报逻辑csrl,用以刻画增强行为描述的统一验证属性,给出随机模型检测方法。分析表明,该方法能有效刻画运行时云服务动态行为并对其正确性、可靠性进行验证。
云环境下计算资源动态能耗感知的并行任务调度方法
曹洁?,
计算机科学 , 2013,
Abstract: 云计算是一种新兴的计算模式,倡导一切皆服务。要实现低成本、高效、安全、易用的云计算系统,依然面临诸多挑战,其中,高能耗已成为云计算不可忽视的问题。在计算资源电压可动态调整的环境下,为截止完成时间有要求的并行任务,提出两种满足并行任务截止时间要求的降低并行任务执行能耗的调度方法ssef和egsa。模拟实验表明,提出的算法在保证并行任务截止完成时间要求的条件下能够有效降低并行任务的执行能耗,从而大幅度降低云计算系统的能耗开销。
Pricing Mechanism of TSP Solving Service in Cloud Computing
云计算中TSP问题求解服务的定价机制

栩鸿,
计算机科学 , 2011,
Abstract: The traveling salesman problem(TSP) is a typical path optimization problem which has similar problems and applications in urban transportation planning, logistic transport and communication network settings. However, TSP is a NP hard problem When problem scale is very large, large scale parallel computing environment such as cloud computing platform is needed. In this paper, we illustrated cloud service pricing mechanism with TSP. Uenerally, pricing mechanism should be fair, flexible, dynamic and flexible. To be fair and reasonable, there arc two main aspects to be considered when pricing a service. One is the difficulty of solving the problem including time complexity, space complexity and quantity of data the application input and output. The other is the quality of service including precision of the result, response time and whether the service is provided in peak time or not which can be served for Service Level Agreement between service provider and customer. Next, we proposed principles of pricing the service and pricing formula. Finally,a case study aiming at pricing solving TSP service was given, which has a reference value for pricing NP hard problem in cloud computing environment.
云计算中tsp问题求解服务的定价机制
栩鸿,
计算机科学 , 2011,
Abstract: 旅行商问题(tsp)是一个典型的路径优化问题,在城市交通规划、物流运输、通信网络设置等领域都存在类似的问题和应用。但是,tsp问题的求解是np难的,当问题规模很大时,必须借助大规模并行计算环境,例如云计算平台,以较大的计算开销来获得可行解。以tsp问题为具体实例,研究云计算服务的定价机制。一般情况下,定价机制要满足公平、灵活、动态、自适应。从公平合理角度来看,影响计算服务定价的因素主要有两方面:一是求解问题的难度,包括计算时间复杂性、空间复杂性、输入输出数据规模等;二是求解服务质量,即服务契约,包括可以作为服务等级协定指标的求解精度、响应时间、资源要求等。由此,提出了一种新的云计算中的服务定价机制:cloudpricing。该机制给出了服务定价的一般和具体原则,并给出了相应的定价公式。针对tsp问题求解,进行了具体的定价实例分析,这对云计算中np难问题求解服务的定价有参考意义。
Architecture-aware Parallel Task Clustering Policy in Heterogeneous Computing
异构计算中体系结构感知的并行任务分簇方法

郝水侠,
计算机科学 , 2013,
Abstract: Heterogeneous computing has been a trend of high-productivity computing. Matching between parallel task and architecture in heterogeneous computing becomes a key idea to realize high productivity. We provided parallel task clustering policy based on matching between parallel task and architecture. Firstly we gave the concept of high-produc- tivity and the problem of clustering on heterogeneous computing. Secondly after theoretically analyzing the relation be- tween heterogeneous matching and productivity, we gave the method of realizing respectively computing and structure matching. hhirdly we gave accordingly the architecturcaware parallel task clustering algorithm. Finally the simulation experimental results show that such algorithms can effectively realize heterogeneous matching and enhance the hetero- gcncous computing productivity.
Novel Revocable Short Group Signatures Scheme without Encryption
一种新型的撤销成员的无加密短群签名方案

马海英,
计算机科学 , 2012,
Abstract: Aiming at the intrinsic problems in revocation group signatures,such as reducing group member's computational costs, shortening the signature length and so on, a novel revocation short group signature scheme without encryption was proposed based on the XDDH, LRSW and SDLP assumptions, and it's security was proven. Member revocation was implemented by encoding the validity time into group signature key. In particular, our scheme does not use standard encryption and relies on re-randomizable signature schemes that hide the signed message so as to preserve the anonymity of signers. Our solution outperforms all prior solutions for member revocation in terms of communication and computational costs for the members. Group public key remains constant, and computational costs of signing and verifying are independent of the revocable number, and the signature is only 1195 bits in size.
Parallelization and Parallelism Characteristic Based on Array Element Graph
基于数组元素视图的并行化和特征

,陆鑫达
计算机科学 , 2001,
Abstract: 1 引言近年高性能并行计算研究领域已转到异构计算,因为一个复杂的计算问题,如Grand challenge问题,往往存在多种计算需求,任何单一的计算模式,如:SISD,SIMD,MIMD,数据流等,都不能使求解过程顺利进行。只有按需分配计算模式,才能取得计算性能最优。异构计算的关键是并行性特征的提取。我们已经提出了基于程序结构和基于程序运行性能分析的两种方法,但还不完善。本文希望通过数组元素视图作深入的研究。
探索计算系统异构性的描述
,陈闳中
计算机科学 , 2003,
Abstract:
第1页/共72565条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.