检索结果-内蒙古大学图书馆

Extended and improved slicing technologies for Petri nets

High technology Letters 2013年第1期19卷 98-104页

作者： Yu, Wangyang Yan, Chungang Ding, Zhijun Fang, Xianwen Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Petri net is an important tool to model and analyze concurrent systems, but Petri net models are frequently large and complex, and difficult to understand and modify. Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs, and has been widely used in specification level for model reduction, but researches on slicing of Petri nets are still limited. According to the idea of program slicing, this paper extends slicing technologies of Petri nets to four kinds of slices, including backward static slice, backward dynamic slice, forward static slice and forward dynamic slice. Based on the structure properties, the algorithms of obtaining two kinds of static slice are constructed. Then, a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets. At last, forward dynamic slice can be obtained through the reachability marking graph under a special marking. The algorithms can be used to reduce the size of Petri net, which can provide the basic technical support for simplifying the complexity of formal verification and analysis. © by HIGH technology LETTERS PRESS.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Modeling and monitoring of online shopping business processes based on system behavior patterns

引用

Journal of Computational Information systems 2013年第12期9卷 4691-4698页

作者： Yu, Wangyang Yan, Chungang Ding, Zhijun Zhong, Junzhu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Online shopping integrating third-party payment platforms (TPPs) has rapidly developed recently. The integration leads to new security problems derived from complex interactions among Application Programming Interfaces (APIs), and the detection of such defects in application-level is costly and difficult. To deal with these security issues at the online stages, this paper presents a framework of modeling and monitoring online shopping business processes from the point of legal behavior patterns. We present Online Shopping Net (OSN) to model the normal business process, and make it as the legal behavior pattern used to monitor system behaviors. Then, a monitor based on OSN is constructed. The system behaviors beyond the legal behavior pattern would be alarmed and blocked. It is a novel attempt to guarantee the security of online shopping from the point of behaviors and online monitoring. Using the active defense tactics, we can effectively prevent the illegal behaviors of the users at application-level instead of constantly fixing bugs of applications. As a case study, we simulate an e-commerce site and a TPP, and the monitor can effectively prevent the malicious behaviors appearing recently. © 2013 by Binary Information Press.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation 13

Accelerating GPGPU architecture simulation

引用

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

作者： Zhibin Yu Lieven Eeckhout Nilanjan Goswami Tao Li Lizy John Hai Jin Chengzhong Xu Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China ELIS Department Ghent University Ghent Belgium Intelligent Design of Efficient Architectures Lab University of Florida Gainesville USA Department of Electrical and Computer Engineering University of Texas at Austin Austin USA Service Computing Technologies and System Lab/Cluster and Grid Computing Lab HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University Detroit USA

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： micro-architecture simulation performance general purpose graphics processing unit (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

A control mechanism about quality of service for resource management in simulation grid

A control mechanism about quality of service for resource ma...

引用

4th International Conference on Computational and Information Sciences, ICCIS 2012

作者： Kuang, Ping Jin, Hai Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769547893

The simulation grid has become a very important research topic. In order to ensure the QoS of resource management, we present a control mechanism in simulation grid, which is based on the prediction methods. In the control mechanism, we first introduce our resource management module in simulation grid. Then, we propose a resource allocation algorithm. In order to justify the feasibility and the availab.lity of this control mechanism, a series of experiments have been done. The results show that it is feasible to schedule the system resources and control the QoS of system resources for tasks in simulation grid. © 2012 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed transactional memory system

An efficient distributed transactional memory system

引用

11th IEEE International Conference on Trust, Security and Privacy in computing and Communications, TrustCom-2012

作者： Peng, Xin Liao, Xiaofei Jin, Hai Fan, Xuepeng Tu, Xuping Yu, Linchen Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769547459

Transactional memory (TM) is a parallel programming concept which reduces challenges in parallel programming. Existing distributed transactional memory system consumes too much bandwidth and brings high latency. In this work, we present Transactional Memory system for cluster (Clustm), a generalized and scalab.e distributed transactional memory system. Our system addresses several open issues posed by this domain, including transactional memory consistency protocol, cache consistency protocol, and the distribution strategy of the metadata of shared data across the cluster. Then, we evaluate our design with several workloads, and the results demonstrate outstanding performance. © 2012 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Efficient disk I/O scheduling with QoS guarantee for Xen-based hosting platforms 12

Efficient disk I/O scheduling with QoS guarantee for Xen-bas...

引用

12th IEEE/ACM International Symposium on cluster, Cloud and grid computing, CCgrid 2012

作者： Ling, Xiao Jin, Hai Ibrahim, Shadi Cao, Wenzhi Wu, Song Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China INRIA Rennes Bretagne Atlantique Rennes France

ISBN: (纸本)9780769546919

In this paper, we address the problem of allocating disk resources to guarantee specified latency and throughput targets of VMs while keeping efficient disk I/O. Accordingly, we present two-level scheduling framework, namely Flubber, in Xen-based hosting platform that decouples latency and throughput allocation. The high-level throughput control regulates the pending requests from the VMs, in order to meet the throughput requirements of different VMs and ensure isolation. Meanwhile, the low-level latency control, by the virtue of the batch and delay EDF mechanism, reorders all pending requests from VMs based on the their deadlines, and batches them to the disk device considering the locality of accesses across VMs. We have implemented Flubber with intensive evaluations on Xen-based host. The results show that Flubber can simultaneously meet the different service requirements of VMs while improving the efficiency of the physical disk. In contrast to CFQ, besides that Flubber achieves the desired QoS of each VM, Flubber speeds up the sequential and random read by 17% and 25% due to the efficient physical disk utilization. © 2012 IEEE.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Probabilistic critical path identification for cost-effective monitoring of service-based systems

Probabilistic critical path identification for cost-effectiv...

引用

2012 IEEE 9th International Conference on services computing, SCC 2012

作者： He, Qiang Han, Jun Yang, Yun Schneider, Jean-Guy Jin, Hai Versteeg, Steve Faculty of Information and Communication Technologies Swinburne University of Technology Melbourne VIC 3122 Australia Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China CA Labs. Melbourne VIC Australia

ISBN: (纸本)9780769547534

When operating in volatile environments, service-based systems (SBSs) that are built through dynamic composition of component services must be monitored in order to guarantee the response times of the SBSs. In particular, the critical path of a composite SBS, i.e., the execution path in the service composition with the maximum execution time, should be prioritised in cost-effective monitoring as it determines the response time of the SBS. In volatile operating environments, the critical path of a SBS is probabilistic. As such, it is important to estimate the criticalities of the execution paths and the component services, i.e., the probabilities that they are critical, to decide which parts of the system to monitor. In this paper, we propose a novel approach to the identification of Probabilistic Critical Path for service-based systems (PCP-SBS). PCP-SBS takes into account the probabilistic nature of the critical path and calculates path criticalities in the context of service composition. We evaluate PCP-SBS experimentally using SBSs that are synthetically composed based on a real-world Web service dataset. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A novel memory-based storage optimization approach for RDF data supporting SPARQL query 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Zhao, Feng Wu, Delong Yuan, Pingpeng Jin, Hai Service Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Due to sparse of RDF data, RDF storage approaches using triple table or binary file rarely show high storage usage and high query performance. To achieve the goal of decreasing storage space and improving the efficiency and generality of query on RDF data, a memory-based storage optimization approach supporting SPARQL query is proposed in this paper. For storage efficiency, strings are transferred to 32-bit integer identifiers, RDFS/OWL is used to organize the RDF data storage model, vertical partition method and other ways are utilized to split and organize the RDF triples. For query generality, the storage model also partially supports SPARQL query. Furthermore, by getting the statistics of the underlying storage data, we construct a SPARQL query optimized module. Experiments show that our query optimization module greatly improves the performance of the SPARQL query. Compared with Jena Memory and RDF-3X, our storage method has higher performance. © 2011 Springer Science+Business Media B.V.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Dynamic processor resource configuration in virtualized environments

Dynamic processor resource configuration in virtualized envi...

引用

International Conference on services computing

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769544625

Virtualization can provide significant benefits in data centers, such as dynamic resource configuration, live virtual machine migration. services are deployed in virtual machines (VMs) and resource utilization can be greatly improved. In this paper, we present VScheduler, a system that dynamically adjusts processor resource configuration of virtual machines, including the amount of virtual resource and a new mapping of virtual machines and physical nodes. VScheduler implements a two-level resource configuration scheme - local resource configuration (LRC) for an individual virtual machine and global resource configuration (GRC) for a whole cluster or data center. GRC especially takes variation tendency of workloads into account when remapping virtual machines to physical nodes. We implement our techniques in Xen and conduct a detailed evaluation using RUBiS and dbench. The experimental results show that VScheduler not only satisfies resource demands of services, but also reduces the number of virtual machines migration, which can provide a stable VM distribution on physical nodes in data centers. © 2011 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

An efficient metadata management method in large distributed storage systems 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Ran, Longbo Jin, Hai Cluster and Grid Computing Lab. Services Computing Technology and System Laboratory Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Efficient metadata management is a critical aspect of overall system performance in large distributed storage systems. Directory subtree partitioning and traditional hashing are two common techniques used for managing metadata in such systems, but both have some shortcomings, for example, in directory subtree partitioning method, the root node easily becomes a bottleneck, and for traditional hashing, a large directory hierarchy must be maintained and traversed. In this paper, we present a new method called directory-level-based metadata management that has high efficiency while avoiding the shortcomings of traditional methods. © 2011 Springer Science+Business Media B.V.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：