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

2013 IEEE 2013 22nd International Conference on computer Communication and Networks, ICCCN 2013

作者： Wei, Kaimin Zeng, Deze Guo, Song Xu, Ke State Key Lab. of Software Development Environment Beihang University China School of Computer Science and Engineering University of Aizu Japan

ISBN: (纸本)9781467357746

In Delay Tolerant Networks (DTNs), the connections between mobile nodes are intermittent and constant end-to-end paths rarely exist. In order to achieve high delivery ratio, most existing DTN routing algorithms favor the ''multi-hop forwarding'' fashion where a message can be forwarded by multiple relay nodes in the hope that one of the employed relay nodes can deliver the message to the destination node. Since aggressively employing relay nodes may incur intolerable delivery cost to resource-constrained mobile nodes in DTNs, it is significant to design a cost-efficient routing protocol that can achieves high delivery ratio. In this paper, we first utilize the small-world feature to limit the maximum forwarding hops in a reasonable way and then propose a greedy relay node selection strategy. A cost-efficient social-aware forwarding algorithm called TBSF (the-best-so-far) is then presented. Extensive simulations on real mobility traces are conducted to evaluate the performance of TBSF. Simulation results show that, in comparison with several well-known routing algorithms, TBSF can achieve high performance in terms of delivery ratio and delivery delay while with much lower delivery cost. © 2013 IEEE.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Multi-threaded code generation from Signal program to OpenMP

引用

Frontiers of computer science 2013年第5期7卷 617-626页

作者： Kai HU Teng ZHANG Zhibin YANG State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China IRIT-CNRS Universite de Toulouse Toulouse 31062 France

The use of multi-core processors will become a trend in safety critical systems. For safe execution of multi- threaded code, automatic code generation from formal spec- ification is a desirable method. Signal, a synchronous lan- guage dedicated for the functional description of safety crit- ical systems, provides soundness semantics for determinis- tic concurrency. Although sequential code generation of Sig- nal has been implemented in Polychrony compiler, deter- ministic multi-threaded code generation strategy is still far from mature. Moreover, existing code generation methods use certain multi-thread library, which limits the cross plat- form executions. OpenMP is an application program inter- face （API） standard for parallel programming, supported by several mainstream compilers from different platforms. This paper presents a methodology translating Signal program to OpenMP-based multi-threaded C code. First, the intermedi- ate representation of the core syntax of Signal using syn- chronous guarded actions is defined. Then, according to the compositional semantics of Signal equations, the Signal pro- gram is synthesized to dependency graph （DG）. After par- allel tasks are extracted from dependency graph, the Signal program can be finally translated into OpenMP-based C code which can be executed on multiple platforms.

关键词： multi-thread synchronous language Signal,code generation OpenMP

来源：评论

学校读者我要写书评

暂无评论

A layered filtering method based on multi-resolution geometric model

引用

Journal of Computational Information Systems 2013年第14期9卷 5651-5658页

作者： Zou, Zhiwen Wang, Zhenghui Chen, Jiming Pan, Jingui Li, Gen School of Computer Science and Telecommunications Engineering Jiangsu University Zhenjiang 212013 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

In order to reduce network traffic in distributed virtual environment, combined LOD techniques with active interest management based on layered interest management, a layered filtering method based on multi-resolution geometric model is proposed in this paper. This method constructs multi-resolution geometric model using dynamic model simplification algorithm, then creates the mapping from matching degree to geometric resolution, and a layered filtering model is proposed based on dynamic mapping. Experimental results and analysis demonstrate that layered filtering technology based on multi-resolution geometric model can reduce the amount of network data transmission effectively. 1553-9105/Copyright © 2013 Binary Information Press.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Analysis and optimization of CFS scheduler on NUMA-based systems

Analysis and optimization of CFS scheduler on NUMA-based sys...

引用

2012 International Conference on Emerging Technologies for Information Systems, Computing, and Management, ICM 2012

作者： Tian, Hongyun Zhang, Kun Ruan, Li Zhu, Mingfa Xiao, Limin Li, Xiuqiao Liu, Yuhang State Key Laboratory of Software Development Environment Beijing China School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781461470090

Non Uniform Memory Access (NUMA) architecture becomes more and more popular as it has better scalab.lity than Uniform Memory Access (UMA). However, all previous work on the operation system scheduler assumed that the underlying system is UMA. As a result, the performance degrades on NUMA machines due to lacking of consideration to the underlying hardware. Researchers discover that the Completely Fair Scheduler (CFS) does not work smoothly on NUMA machines and even interfere performance relative to the O (1) scheduler. In this paper researchers investigate the causes for the performance decline and devise an architecture aware task-bound approach for NUMA system, which can help the CFS scheduler works efficiently on NUMA platforms. The evaluation shows that the approach can upgrade the system performance by more than 60 % on average. The research has great significance to the development and popularity of domestic operating system. © 2013 Springer science+Business Media New York.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

An evaluation framework for software crowdsourcing

引用

Frontiers of computer science 2013年第5期7卷 694-709页

作者： Wenjun WU Wei-Tek TSAI Wei LI State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ85281 USA Department of Computer Science and Technology INLIST Tsinghua University Beijing 100084 China

Recently software crowdsourcing has become an emerging area of software engineering. Few papers have pre- sented a systematic analysis on the practices of software crowdsourcing. This paper first presents an evaluation frame- work to evaluate software crowdsourcing projects with re- spect to software quality, costs, diversity of solutions, and competition nature in crowdsourcing. Specifically, competi- tions are evaluated by the min-max relationship from game theory among participants where one party tries to minimize an objective function while the other party tries to maximize the same objective function. The paper then defines a game theory model to analyze the primary factors in these min- max competition rules that affect the nature of participation as well as the software quality. Finally, using the proposed eval- uation framework, this paper illustrates two crowdsourcing processes, Harvard-TopCoder and AppStori. The framework demonstrates the sharp contrasts between both crowdsourc- ing processes as participants will have drastic behaviors in engaging these two projects.

关键词： crowdsourcing software engineering competi-tion rules game theory

来源：评论

学校读者我要写书评

暂无评论

A framework for porting linux OS to a cc-NUMA server based on loongson processors

A framework for porting linux OS to a cc-NUMA server based o...

引用

2012 International Conference on Emerging Technologies for Information Systems, Computing, and Management, ICM 2012

作者： Zhang, Kun Tian, Hongyun Ruan, Li Xiao, Limin Li, Yongnan Liu, Yuhang State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781461470090

In order to make the Linux operating system availab.e on a cache coherence NUMA (cc-NUMA) server based on Loongson processors, a family of general-purpose MIPS64 CPUs developed by the Institute of Computing Technology in China, this paper proposes a framework for porting Linux operating system to this cc-NUMA server. Researchers present the overall port scheme after analyzing the framework of the Linux kernel and the architecture of the hardware platform, and then they discuss the transplantation in details with processor-level transplantation, memory management transplantation, interrupt and trap transplantation. The performance evaluation shows that the whole system works stable and the ported operating system could reach about 30 % of the theoretical peak value of floating-point calculation. The method could port Linux OS to the target board successfully and can be used on other platforms. The research has great significance to the development of the domestic Loongson processor and the cc-NUMA platform based on Loongson processors. © 2013 Springer science+Business Media New York.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Circular convex bipartite graphs: Feedback vertex set

Circular convex bipartite graphs: Feedback vertex set

引用

7th International Conference on Combinatorial Optimization and Applications, COCOA 2013

作者： Lu, Zhao Lu, Min Liu, Tian Xu, Ke Key Laboratory of High Confidence Software Technologies School of Electronic Engineering and Computer Science Peking University Beijing 100871 China National Lab. of Software Development Environment Beihang University Beijing 100191 China

ISBN: (纸本)9783319037790

A feedback vertex set is a subset of vertices, such that the removal of this subset renders the remaining graph cycle-free. The weight of a feedback vertex set is the sum of weights of its vertices. Finding a minimum weighted feedback vertex set is tractable for convex bipartite graphs, but NP-complete even for unweighted bipartite graphs. In a circular convex (convex, respectively) bipartite graph, there is a circular (linear, respectively) ordering defined on one class of vertices, such that for every vertex in another class, the neighborhood of this vertex is a circular arc (an interval, respectively). The minimum weighted feedback vertex set problem is shown tractable for circular convex bipartite graphs in this paper, by making a Cook reduction (i.e. polynomial time Turing reduction) for this problem from circular convex bipartite graphs to convex bipartite graphs. © Springer International Publishing 2013.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Shedder: A metadata sharing management method across multi-clusters

Shedder: A metadata sharing management method across multi-c...

引用

13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2013

作者： Hao, Qinfen Zhong, Qianqian Ruan, Li Zhang, Zhenzhong Xiao, Limin State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9783319038582

With the increase of large number of data, multi-clusters structure has been adopted for data storage. Therefore, the demand for file metadata sharing across global scale clusters is quickly rising. However, today's software can not provide features to reflect these desires well. In this paper, We propose and develop a metadata sharing management method called Shedder. First Shedder can allow customized multi-clusters metadata sharing structure. Next, Shedder can provide highly efficient global synchronization for all clusters. Finally, Shedder allows customized user view generated from global namespace. Our evaluation for Shedder shows that Shedder provides low latency for global synchronization. Dynamic transformation from global namespace to customized user view also has low time cost for different size of workloads. © Springer International Publishing Switzerland 2013.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Accelerate demodulation of quadrature amplitude modulation using GPU

Accelerate demodulation of quadrature amplitude modulation u...

引用

2013 2nd International Conference on Manufacturing engineering and Process, ICMEP 2013

作者： Gao, Xiao Peng Wang, Si Yuan Wan, Han State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Xueyuan Road No.37 Haidian District Beijing China

ISBN: (纸本)9783037857076

Quadrature amplitude modulation (QAM) is widely used in communication systems. The traditional QAM demodulation method was implemented in hardware. This paper proposes a demodulation algorithm using GPU. The GPU algorithm is easier to add new features than hardware implementation and reaches 57x speed up compared with the serial algorithm on CPU. It is shown that the QAM demodulation algorithm gained significant performance increase due to the natural parallism of the GPU, using Compute Unified Device Architecture (CUDA). © (2013) Trans Tech Publications, Switzerland.

关键词： Quadrature amplitude modulation

来源：评论

学校读者我要写书评

暂无评论

A DNA computing system of modular-multiplication over finite field GF(2n)

A DNA computing system of modular-multiplication over finite...

引用

13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2013

作者： Li, Yongnan Xiao, Limin Ruan, Li Zhang, Zhenzhong Li, Deguo State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9783319038582

The enormous parallel computing ability and high memory density of DNA computing bring potential challenges and opportunities to traditional cryptography. Finite field GF(2n) is one of the most commonly used mathematic sets for cryptography. It is an open problem that how to implement the arithmetic operations over finite field GF(2n) based on DNA computing. Existing research has the problem that the lengths of parameters in the DNA tile assembly process could not match each other strictly. This paper proposes a parallel molecular computing system to compute the modular-multiplication, an operation combining multiplication and reduction over finite field GF(2n). The multiplication and the reduction are executed simultaneously in this system. One concrete example of 1100 · 1001 mod 10011 is proposed to show the details of our tile assembly system. The time complexity of this system is Θ(n) and the space complexity is Θ(n2). This system requires 210 types of computation tiles and 17 types of boundary tiles. © Springer International Publishing Switzerland 2013.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：