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

2013 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2013

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

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%.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Location-Driven Geographical Topic Discovery

Location-Driven Geographical Topic Discovery

引用

International Conference on Semantics, Knowledge and grid (SKG)

作者： Li Zhang Xiaoping Sun Hai Zhuge Knowledge Grid Lab. Key Lab. of Intell. Inf. Process. Beijing China University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences China

With the prevalence of geo-position devices GPS and smart phones, textual information, long or short, associated with GPS tags usually denoted by a coordinate with latitude and longitude is widely encountered on the Web. For example, in Twitter, smart phones record the location of every tweet after it is authorized. The spatial objects on Google map are also presented with some textual descriptions. These data provide researchers two-dimension perspectives, fusing both location and textual dimension. In real world, similar concepts, discussions, product sales and geographic objects are often gathered together which people are interest in. This paper studied three methods that combine a density-based clustering method DBSCAN with LDA (Latent Dirichlet Allocation) method in different ways to discover geographical topics. The first method clusters the GPS tagged documents and then for each clustered region, it applies LDA on the document set in that region, The second method first uses DBSCAN to find clusters among documents, merges documents from each cluster region into one document and form one document set on which LDA is applied, The third method applies LDA on the whole document set, and then, extracts topics generated by LDA in a specific region from DBSCAN. Abundant experiments are conducted with varying parameters. It is shown that three methods performed well in discovering topics in clusters, but the first two methods take much less computing time.

关键词： Global Positioning System Sports equipment Space vehicles Computers Educational institutions Data mining Analytical models

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Density based collective spatial keyword query

Density based collective spatial keyword query

引用

2012 8th International Conference on Semantics, Knowledge and grids, SKG 2012

作者： Zhang, Li Sun, Xiaoping Zhuge, Hai Knowledge Grid Lab. Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9780769547947

Geographic objects with descriptive text are gaining in prevalence in many web services such as Google map. Spatial keyword query which combines both the location information and textual description stands out in recent years. Existing works mainly focus on finding top-k Nearest Neighbours where each node has to match the whole querying keywords. A collective query has been proposed to retrieve a group of objects nearest to the query object such that the group's keywords cover query's keywords and has the shortest inner-object distances. But the previous method does not consider the density of data objects in the spatial space. In practice, a group of dense data objects around a query point will be more interesting than those sparse data objects. Inner distance of data objects of a group cannot reflect the density of the group. To overcome this shortage, we proposed an approximate algorithm to process the collective spatial keyword query based on density and inner distance. The empirical study shows that our algorithm can effectively retrieve the data objects in dense areas. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

System level power characterization of multi-core computers with dynamic frequency scaling support

System level power characterization of multi-core computers ...

引用

2012 IEEE International Conference on Cluster computing Workshops, Cluster Workshops 2012

作者： Jiang, Congfeng Grid and Service Computing Technology Lab Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780768548449

Multi-core architecture has become prominent in modern processors including personal computers, large scale server systems and embedded systems. While multi core processors provide higher computing performance, they have higher power density and also consume more energy than traditional single core processors. Therefore, Dynamic Frequency Scaling (DFS) is mostly implemented in multi-core processors in order to reduce power and energy consumptions. However, the built-in dynamic frequency scaling ability in processors is not enough for highly dynamic and mixed workloads including computing intensive and I/O intensive computing workloads. In this paper we conducted extensive experiments to characterize the processor utilization, power consumption, and application performance. We provide the experiment results and observations. We found that: (1) There is no power model that is capable for different computing systems, even for the same workloads. (2) Processor utilization is not always the indicator for power consumption. For example, in some scenarios such as mixed type and I/O intensive applications, the power consumption is not proportional to the processor utilization and even keeps approximately unchanged. (3) Different computing systems with different subsystems configurations, i.e., processors, memories, and disks, have different power curves due to their proportion in total system-level power consumption because these different subsystems consume different basic power and dynamic power when running different workloads. © 2012 IEEE.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：