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

2012 IEEE 19th International Conference on Web Services, ICWS 2012

作者： Wu, Yan Yan, Chungang Ding, Zhijun Wang, Pengwei Jiang, Changjun Zhou, Mengchu Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States School of Electronics and Information Engineering Tongji University Shanghai China

ISBN: (纸本)9780769547527

With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to improve the efficiency of service discovery and composition is important. This paper proposes three categorization rules to classify services for a large scale repository to form a relational taxonomy. The service retrieve scope can be drastically narrowed by this taxonomy. Therefore, the efficiency of service discovery and service composition can be greatly improved. We evaluate and compare the performance of the proposed method and other related ones via a publicly available test set, ICEBE05. The experimental results validate the effectiveness and high efficiency of the proposed one. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

High efficient memory race recording scheme for parallel program deterministic replay under multi-core architecture

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2012年第1期49卷 64-75页

作者： Liu, Lei Huang, He Tang, Zhimin Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China MIPS Technologies Shanghai 210021 China

Current shared memory multi-core and multiprocessor systems are nondeterministic. When these systems execute a multithreaded application, even if supplied with the same input, they could produce a different output each time. It frustrates debugging and limits the ability to properly test multithreaded code, and is becoming a major stumbling block to the much-needed widespread adoption of parallel programming. The support for deterministic replay of multithreaded execution is greatly helpful in finding concurrency bugs. A memory race recording scheme, named Rainbow, is proposed. Its core idea is to make inter-thread communications fully deterministic. The unique feature of Rainbow is that it precisely sets up happens-before relationships between conflicting memory operations among different threads. By using effective, bloom-filter based, coherence history queue, Rainbow removes redundant happens-before relations implied in the already generated log and enables a compact log. Rainbow adds the modest hardware to the base multi-core processors, and the coherence protocol is unmodified. The analysis results show that Rainbow reduces the log size by 17% of a state-of-the-art scheme, and the records execution speed is similar to that of release consistency (RC) execution and replays at about 93% of its speed. The determinism can be provided with little performance cost using our architecture proposals on the state-of-the-art hardware, and the software-only approaches can be utilized on existing systems without problem.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

引用

Journal of computer Science & technology 2011年第5期26卷 866-874页

作者：谭光明刘萍卜东波刘燕兵 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Key Laboratory of Network Technology Institute of Computing TechnologyChinese Academy of Sciences

Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion *** this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core *** observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of *** multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is *** formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization *** results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system.

关键词： parallel algorithm multi-core multiple pattern matching

来源：评论

学校读者我要写书评

暂无评论

A clustering-based scheme for concurrent trace in debugging NoC-based multicore systems 12

A clustering-based scheme for concurrent trace in debugging ...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Jianliang Gao Jianxin Wang Yinhe Han Lei Zhang Xiaowei Li School of Information Science and Engineering Central South University China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9783981080186

Concurrent trace is an emerging challenge when debugging multicore systems. In concurrent trace, trace buffer becomes a bottleneck since all trace sources try to access it simultaneously. In addition, the on-chip interconnection fabric is extremely high hardware cost for the distributed trace signals. In this paper, we propose a clustering-based scheme which implements concurrent trace for debugging Network-on-Chip (NoC) based multicore systems. In the proposed scheme, a unified communication framework eliminates the requirement for interconnection fabric which is only used during debugging. With clustering scheme, multiple concurrent trace sources can access distributed trace buffer via NoC under bandwidth constraint. We evaluate the proposed scheme using Booksim and the results show the effectiveness of the proposed scheme.

关键词： Multicore processing Bandwidth Fabrics Debugging Clustering algorithms Real time systems system-on-a-chip

来源：评论

学校读者我要写书评

暂无评论

On iterative liveness-enforcement for a class of generalized Petri nets

On iterative liveness-enforcement for a class of generalized...

引用

2012 IEEE International Conference on Automation Science and Engineering: Green Automation Toward a Sustainable Society, CASE 2012

作者： Hou, Yifan Liu, Ding Zhou, Mengchu School of Electro-Mechanical Engineering Xidian University No. 2 South Taibai Road Xi'an 710071 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781467304283

This work presents an iterative liveness-enforcing method for a class of generalized Petri nets, which can model flexible manufacturing systems. The proposed method checks the liveness of net models using mixed integer programming and controls the token allocations of resource places instead of siphons using a liveness and resource usage ratio-enforcing supervisor. The enumeration of a kind of special structures, which is required in the previous work, is avoided and the number of iterations is bounded by the number of shared resource places in the net model. All strict minimal siphons in the controlled systems are minimally controlled. Several explanatory examples are used to illustrate this method. © 2012 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable Data Aggregation Scheme in Wireless Sensor Networks

引用

IEEE Transactions on Parallel and Distributed systems 2012年第10期23卷 1958-1969页

作者： Cheng Wang Changjun Jiang Shaojie Tang Xiang-Yang Li Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science and Engineering Tsinghua National Laboratory for Information Science and Technology (TNLIST) University of Tongji China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.

关键词： Throughput Wireless sensor networks Temperature measurement Protocols Lattices Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

Real-time rendering techniques of lunar massive terrain data based on wavelet

引用

Journal of Computational Information systems 2012年第14期8卷 6079-6085页

作者： Feng, Yinghao Wang, Riwei Zhang, Hua Wen, Xianbin Hou, Huaiyu Jiang, Mingyan Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China Shanghai Aviation Precision Machinery Research Institute Shanghai 201600 China

A terrain data organization method was proposed in this article in order to solve large scale data realtime rendering problem, which combines wavelet transform and quadtree to organize the terrain data, to further build a multi-resolution lunar terrain model. The experiment result shows that this method can achieve real-time visualization and interaction of massive terrain data of the whole surface of lunar. © 2011 by Binary Information Press.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

An architecture description language based on dynamic description logics

An architecture description language based on dynamic descri...

引用

7th IFIP International Conference on Intelligent Information Processing, IIP 2012

作者： Wang, Zhuxiao Peng, Hui Guo, Jing Zhang, Ying Wu, Kehe Xu, Huan Wang, Xiaofeng School of Control and Computer Engineering State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University Beijing 102206 China Education Technology Center Beijing International Studies University Beijing 100024 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783642328909

ADML is an architectural description language based on Dynamic Description Logic for defining and simulating the behavior of system architecture. ADML is being developed as a new formal language and/or conceptual model for representing the architectures of concurrent and distributed systems, both hardware and software. ADML embraces dynamic change as a fundamental consideration, supports a broad class of adaptive changes at the architectural level, and offers a uniform way to represent and reason about both static and dynamic aspects of systems. Because the ADML is based on the Dynamic Description Logic DDL( (D)), which can represent both dynamic semantics and static semantics under a unified logical framework, architectural ontology entailment for the ADML languages can be reduced to knowledge base satisfiability in DDL( (D)), and dynamic description logic algorithms and implementations can be used to provide reasoning services for ADML. In this article, we present the syntax of ADML, explain its underlying semantics using the Dynamic Description Logic DDL( (D)), and describe the core architecture description features of ADML. © 2012 IFIP International Federation for Information Processing.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

New Methodologies for Parallel Architecture

引用

Journal of computer Science & technology 2011年第4期26卷 578-587页

作者：范东睿李晓维李国杰 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences

Moore＇s law continues to grant computer architects ever more transistors in the foreseeable future, and parallelism is the key to continued performance scaling in modern microprocessors. In this paper, the achievements in our research project, which is supported by the National Basic Research 973 Program of China, on parallel architecture, are systematically presented. The innovative approaches and techniques to solve the significant problems in parallel architecture design are smnmarized, including architecture level optimization, compiler and language-supported technologies, reliability, power-performance efficient design, test and verification challenges, and platform building. Two prototype chips, a multi-heavy-core Godson-3 and a many-light-core Godson-T, are described to demonstrate the highly scalable and reconfigurable parallel architecture designs. We also present some of our achievements appearing in ISCA, MICRO, ISSCC, HPCA, PLDI, PACT, IJCAI, Hot Chips, DATE, IEEE Trans. VLSI, IEEE Micro, IEEE Trans. computers, etc.

关键词： architecture multi-core many-core parallelism

来源：评论

学校读者我要写书评

暂无评论

Green challenges to system software in data centers

引用

中国计算机科学前沿 2011年第3期5卷 353-368页

作者： Yuzhong SUN Yiqiang ZHAO Ying SONG Yajun YANG Haifeng FANG Hongyong ZANG Yaqiong LI Yunwei GAO Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100190 China

With the increasing demand and the wide application of high performance commodity multi-core processors,both the quantity and scale of data centers grow dramatically and they bring heavy energy *** and engineers have applied much effort to reducing hardware energy consumption,but software is the true consumer of power and another key in making better use of *** software is critical to better energy utilization,because it is not only the manager of hardware but also the bridge and platform between applications and *** this paper,we summarize some trends that can affect the efficiency of data ***,we investigate the causes of software *** on these studies,major technical challenges and corresponding possible solutions to attain green system software in programmability,scalability,efficiency and software architecture are ***,some of our research progress on trusted energy efficient system software is briefly introduced.

关键词： green software multi-core data center power efficient system software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：