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

Overlay technologies for internet-based virtual computing environment

Jisuanji Xuebao/Chinese Journal of Computers 2008年第9期31卷 1516-1524页

作者： Lu, Xi-Cheng Li, Dong-Sheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and support efficient resource discovery is an important approach to aggregate resources on-demand in Internet-based Virtual Computing Environment (iVCE). This paper gives an overview of research advances on overlay technologies in iVCE. To adapt to the growth and autonomy of Internet resources, an overlay topology construction mechanism based on Kautz graph is first introduced, and it is extended to a universal method for constructing overlay topologies based on arbitrary regular graphs. To adapt to the diversity of Internet resources, a grouped overlay topology construction mechanism is then proposed. Based on the overlay constructed above, an efficient range query scheme is presented, and the optimization methods of overlay topology as well as other complex query techniques are discussed.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Review on bioinformatics analysis of genome-scale metabolic network decomposition

引用

Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology 2008年第3期30卷 48-52页

作者： Wang, Zheng-Hua Zhou, Ting-Ting National Laboratory for Parallel and Distributed Processing National Univ. of Defense Technology Changsha 410073 China

As the large-scale data on molecular interaction available increases, the study on biological networks has ignited more and more attention. As the execution level of cellular functions, the structural composition of metabolic networks not only reflects the execution of cellular functions step by step, but also influences the pathway analysis of metabolic engineering. Hence, as a key step, a sound decomposition of global metabolic networks is not only significant for further exploring the structure and function of genome-scale biological networks, but also necessary for favorably developing the pathway analysis of metabolic engineering. Having reviewed the fruitful study of the macro-structure and topological characteristics, and analyzed some available decomposition approaches, this paper concludes that the lack of reasonable and purposeful evaluation criterions is one urgent problem in the present study of metabolic network decomposition. Besides, the future trend is to develop more effective decomposition models with more information and by more advanced approaches, as well as expanding the application range of network decomposition.

关键词： Bioinformatics Evaluation criterion Metabolic network Network decomposition

来源：评论

学校读者我要写书评

暂无评论

Load scheduling: Reducing pressure on distributed register files for free

Load scheduling: Reducing pressure on distributed register f...

引用

Asia and South Pacific Design Automation Conference

作者： Mei Wen Nan Wu Maolin Guan Chunyuan Zhang National Laboratory for Parallel and Distributed Processing Changsha Hunan China

ISBN: (纸本)9781424419210

In this paper we describe load scheduling, a novel method that balances load among register files by residual resources. Load scheduling can reduce register pressure for clustered VLIW processors with distributed register files while not increasing VLIW scheduling length. We have implemented load scheduling in compiler for Imagine and FT64 stream processors. The result shows that the proposed technique effectively reduces the number of variables spilled to memory, and can even eliminate it. The algorithm presented in this paper is extremely efficient in embedded processor with limited register resource because it can improve registers utilization instead of increasing the requirement for the number of registers.

关键词： Registers Processor scheduling VLIW Streaming media Delay Memory management Laboratories distributed processing Scheduling algorithm Power dissipation

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on data dependence

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第5期31卷 741-753页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on key-attributes

引用

Ruan Jian Xue Bao/Journal of Software 2008年第8期19卷 2114-2126页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, the update of key-attributes is separated from user update requests. Key-Updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to the nodes having maximum or minimum latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including buffer preprocessing and update-log processing is applied to detect and reconcile conflicts, and then conflicts are solved by policies as last-writer-win and divide-and-rule. Lastly, update-log management method and maintenance method brought by node failure and network partitioning are discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency maintenance method, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform

Weakly hard real-time scheduling algorithm for multimedia em...

引用

IEEE International Conference on Ubi-Media Computing

作者： Tong Wu Shiyao Jin NUDT Changsha Hunan National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)9781424418657

Multiprocessor architectures are becoming more attractive for embedded systems, and also for multimedia embedded systems. In multimedia embedded systems, there exist both hard real-time tasks and multimedia stream with QoS guarantee. In this context, researched on integrated schedule of both hard real-time tasks and streams are urgent affairs. This paper analyzes the shortcomings of the current approach - multimedia server, and then based on the DBP algorithm, proposes an algorithm which also considers the resource constraint. According to the different budget schemes, greedy algorithm and optimistic algorithm are brought up. Results show the performance of the algorithms.

关键词： Real time systems Scheduling algorithm Multimedia systems Embedded system Streaming media Processor scheduling Job shop scheduling Very large scale integration Computer architecture Laboratories

来源：评论

学校读者我要写书评

暂无评论

Improving the Efficiency of Exact Two Dimensional On-Line Pattern Matching Algorithms

Improving the Efficiency of Exact Two Dimensional On-Line Pa...

引用

Panhellenic Conference on Informatics (PCI)

作者： Charalampos S. Kouzinopoulos Konstantinos G. Margaritis Parallel and Distributed Processing Laboratory Department of Applied Informatics University of Macedonia Thessaloniki Greece

This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exact two dimensional pattern matching algorithms. Both the original algorithms and the variants are compared in terms o... 详细信息

ISBN: (纸本)9780769533230

关键词： Algorithm design and analysis Pattern matching Arrays Data structures Imaging Informatics Gain

来源：评论

学校读者我要写书评

暂无评论

Weakly hard real-time schedule algorithm based on cutting down

引用

Ruan Jian Xue Bao/Journal of Software 2008年第7期19卷 1837-1846页

作者： Wu, Tong Jin, Shi-Yao Liu, Hua-Feng Chen, Ji-Ming National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China National Laboratory of Industrial Control Technology Zhejiang University Hangzhou 310027 China

Nowadays, weakly hard real-time is attracted in the research of real-time system. Existing weakly hard real-time scheduling algorithms cannot guarantee the meeting ratio of executing sequence of which the length is larger than fixed window-size. Therefore, this paper, based on the (m, p) constraint, proposes an algorithm which is named as CDBS (cut-down based scheduling). Since the discrimination of the satisfiability of (m, p) constraint needs to go over the whole executing sequence of the task, it's very difficult and infeasible. For this reason, this paper brings an efficient algorithm of cutting down the sequence, proves the correctness of the algorithm. We use proper data structures so that the complexity of judgment is not relevant to the length of sequence. Experiments show the efficiency. Furthermore, we compare CDBS with other classical algorithms, such as EDF, DBP, DWCS, and the results show its competence.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for the Least Areas Path Problem

An Efficient Algorithm for the Least Areas Path Problem

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Gaojun Fan Shiyao Jin Ational Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

The goal of the least areas path problem (LAPP) is to find a path traversing through a given region covered by a set of areas with any arbitrary shape, between a given pair of points and with the property that each point on the path is covered by the least areas. Different the weighted region optimal path problem, the LAPP asks for the cost of each step in path is as low as possible. Based on the relationship between boundaries of sub-regions and the least areas path, we can transform this continuous-domain problem to a discrete one by calculating the coverage of curves of sub-regionspsila boundaries. Depending on binary-search and breadth-first-search, an efficient and fast algorithm was devised for solving the LAPP.

关键词： Algorithm design and analysis Ad hoc networks Approximation algorithms Complexity theory Strontium Approximation methods Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Detecting the Sybil Attack Cooperatively in Wireless Sensor Networks

Detecting the Sybil Attack Cooperatively in Wireless Sensor ...

引用

International Conference on Computational Intelligence and Security

作者： Shaohe Lv Xiaodong Wang Xin Zhao Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424441969

Sybil attack is a network threat introduced by one or more malicious nodes to declare numerous illegal identifies to confuse or even collapse the network applications. A new detection mechanism, called CRSD, is proposed for static wireless sensor networks, which takes use of the received signal strength (RSS) to infer the distance between two identities and further determines the positions relation of the interesting identities by use of the RSS information from multiple neighbor nodes, e.g., via node cooperation. A Sybil attack is detected when two or more different identities have almost the same position. The analysis and simulation results show that, first, Sybil attack deteriorates the system performance significantly and second, CRSD can detect such attack in most cases, thus protecting the overall performance effectively.

关键词： Wireless sensor networks Computational intelligence National security Laboratories distributed processing Electronic mail Performance analysis Analytical models System performance Protection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：