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

Journal of Software 2011年第12 SPEC. ISSUE期6卷 2331-2340页

作者： Zhu, Erzhou Guan, Haibing Dong, Guoxing Yang, Yindong Yang, Hongbo Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

The method of using DBT (dynamic binary translation) to execute the source ISAs binary code on target platforms has been perplexed by low overhead for many years. GPU as a many-core processor has tremendous computational power. Employing GPU as a coprocessor to parallel execute the hot spot of binary code hold a great promise of substantially reduce the overhead of DBT. This paper presents a novel translation framework for constructing the virtual execution environment aiming at accelerating the process of DBT on CPU/GPU based architectures. With parallelizable parts (hot spots) of binary code and their related information, the framework converts the sequential code into PTX form and executes them on GPUs. Under the framework, we need not to rewrite the source code, and the binary compatibility issues between different GPUs are also resolved properly. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that the framework can significantly improve the performance, usually have 10X speedup on average compared to X86 native platforms. Especially, when the scale of input become larger, the performance becomes even better. © 2011 Academy Publisher.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A dynamic-static combined code layout reorganization approach for dynamic binary translation

Journal of Software

引用

Journal of Software 2011年第12 SPEC. ISSUE期6卷 2341-2349页

作者： Guan, Haibing Zhu, Erzhou Chen, Kai Ma, Ruhui He, Yunchao Deng, Haipeng Yang, Hongbo Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Dynamic binary translation (DBT) has attracted much attention as a powerful technique for the runtime adaptation of software among different ISAs. It offers unprecedented flexibility in the control and modification of a program during the runtime. However, its inherent high overhead has perplexed researchers for many years. In order to reduce the overhead of DBT, this paper presents a dynamic-static combined approach to reorganize the layout of software cache. Under this approach, we first employ an emulating execution to collect the profile information and the translated target code. Especially, the path of execution flow will be tracked. In the static phase, based on the profile information collected in the previous stage, we first use the method of code replicating to build the traces, and then reorganize the layout of the target code by putting the hottest traces at the top of the software cache. Because of exact prediction and improved locality, the execution stream will concentrate on a small area with less control transfer. This approach can greatly reduce the overhead of DBT on the condition that the program runs repeatedly. Experimental results on executing the SPEC 2000 benchmarks show that our approach can reduce more than 30% run time on average. © 2011 Academy Publisher.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Performance of a Multi-channel MAC Protocol Implemented in Multi-robot System

Performance of a Multi-channel MAC Protocol Implemented in M...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Feng Zhang Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

In the wireless network, the throughput decreases rapidly with increasing the number of nodes while using single-channel communication simultaneously. Using multi-channel schemes is a solution of boosting throughput. In this paper, we present a protocol implementation, utilizing multiple channels in an autonomous multi-robot system which consists of several simple physical robots, in order to improve throughput. Each robot equipped with a single 802.15.4 radio transceiver which provides 16 channels for use. Our schemes employ a common control-channel and data channels. A simple approach based on RTS / CTS message at control-channel is used to dynamically allocate channels for robots in such distributed network. Some practical experiments were done to check whether control channel congestion can occur when the proposed protocols implemented in our robot systems. As a result, the proposed multi-channel protocol can provide a relatively stable and higher throughput than that obtained by using the CSMA with a single-channel, with increasing the number of simultaneous sending robots.

关键词： Throughput Media Access Protocol Multiaccess communication Robot sensing systems Receivers

来源：评论

学校读者我要写书评

暂无评论

An Improved Content-Based Data Dissemination In Human Contact-Based Network

An Improved Content-Based Data Dissemination In Human Contac...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Chao Jiang Tao Peng Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Limited wireless communication devices carried by individuals make up human contact-based network. Such network often suffers from intermittent connectivity. This fact decreases successful ratio of information spreading and prolongs data delivery process. To get good performance on delivery ratio and transmission delay, providing effective data dissemination algorithm among large-scale human contact-based network is very important. In this paper, we develop an Improved Content-based Data Dissemination algorithm, which efficiently resolves data dissemination as data sources and interested receivers are agnostic of each other. In our algorithm, nodes exchange information according to respective interests with each other, simultaneously, exploit gathered history neighbor interests to dynamically adjust the probability of requesting messages not of interest to themselves and make distributed decisions on whether storing messages or not to benefit other nodes. Compared with the Epidemic algorithm and Opportunistic Content-Based Dissemination algorithm, simulation results have confirmed that our algorithm obtains the highest delivery ratio and almost the lowest transmission delay, as the buffer size and bandwidth are restricted.

关键词： Vectors Algorithm design and analysis Heuristic algorithms Delay Receivers Mobile communication History

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods

A fast algorithm for recovery of jointly sparse vectors base...

引用

14th International Conference on Artificial Intelligence and Statistics, AISTATS 2011

作者： Lu, Hongtao Long, Xianzhong Lv, Jingyuan MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China

The standard compressive sensing (CS) aims to recover sparse signal from single mea- surement vector which is known as SMV model. By contrast, recovery of sparse signals from multiple measurement vectors is called MMV model. In this paper, we consider the recovery of jointly sparse signals in the MMV model where multiple signal measurements are represented as a matrix and the sparsity of signal occurs in common locations. The sparse MMV model can be formulated as a matrix (2;1)-norm minimization problem, which is much more difficult to solve than the l1-norm minimization in standard CS. In this paper, we propose a very fast algorithm, called MMV-ADM, to solve the jointly sparse signal recovery problem in MMV settings based on the alternating direction method (ADM). The MMV- ADM alternately updates the recovered signal matrix, the Lagrangian multiplier and the residue, and all update rules only involve matrix or vector multiplications and summations, so it is simple, easy to implement and much faster than the state-of-the-art method MMVprox. Numerical simulations show that MMV-ADM is at least dozens of times faster than MMVprox with comparable recovery accuracy. Copyright 2011 by the authors.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Learning from imbalanced data sets with a Min-Max modular support vector machine

引用

中国电气与电子工程前沿 2011年第1期6卷 56-71页

作者： Bao-Liang LU Xiao-Lin WANG Yang YANG Hai ZHAO Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghai 200240China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong UniversityShanghai 200240China Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghai 200240China Department of Computer Science and Engineering Shanghai Maritime UniversityShanghai 201306China

Imbalanced data sets have significantly unequal distributions between *** between-class imbalance causes conventional classification methods to favor majority classes,resulting in very low or even nO detection of minority classes.A Min-Max modular support vector machine(M3-SVM)approaches this problem by decomposing the training input sets of the majority classes into subsets of similar size and pairing them into balanced two-class classification *** approach has the merits of using general classifiers,incorporating prior knowledge into task decomposition and parallel *** on two real-world pattern classification problems,international patent classification and protein subcellar localization,demonstrate the effectiveness of the proposed approach.

关键词： imbalanced data Min-Max modular network(M3-network) prior knowledge parallel learning support vector machine (SVM)

来源：评论

学校读者我要写书评

暂无评论

Frontier-based multi-robot map exploration using Particle Swarm Optimization

Frontier-based multi-robot map exploration using Particle Sw...

引用

IEEE Swarm Intelligence Symposium, SIS

作者： Yiheng Wang Alei Liang Haibing Guan School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Exploring an unknown environment using team of autonomous mobile robots is an important task in many real-world applications. Many existing map exploration algorithms are based on frontier, which is the boundary between unexplored space and known open space. In the context of multiple robots, the main problem of frontier-based algorithm is to choose appropriate target points for the individual robots so that they can efficiently explore the different part of the common area. This paper proposed a novel distributed frontier-based map exploration algorithm using Particle Swarm Optimization model for robot coordination. In this algorithm, the robot keeps moving to the nearby frontier to reduce the size of the unknown region, and is navigated towards frontier far away based on the PSO model after exploring the local area. The exploration is completed when there are no frontier cells on the map. Our algorithm has been implemented and tested both in simulation runs and real world experiment. The result shows that our method has a good scalability and efficiency.

关键词： Legged locomotion Robot kinematics Collision avoidance Algorithm design and analysis Robot sensing systems Redundancy

来源：评论

学校读者我要写书评

暂无评论

Private Cloud System Based on BOINC with Support for Parallel and Distributed Simulation

Private Cloud System Based on BOINC with Support for Paralle...

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Yihua Wu Jian Cao Minglu Li Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

Cloud computing provides an efficient way to expose computing capabilities as sophisticated services that can be accessed remotely. It eliminates the need for organizations to maintain extensive infrastructures. Parallel and distributed simulation over cloud will bring us not only the increased productivity and efficiency but also the lower barrier for usage. This paper introduces a private cloud system based on BOINC which supports parallel and distributed simulation. The design idea and implementation method of each component for our system is discussed in detail.

关键词： Computational modeling Monitoring Cloud computing Load modeling Servers Probes

来源：评论

学校读者我要写书评

暂无评论

Compressive Sensing Approach to Urban Traffic Sensing

Compressive Sensing Approach to Urban Traffic Sensing

引用

International Conference on Distributed computing systems

作者： Zhi Li Yanmin Zhu Hongzi Zhu Minglu Li Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University China University of Waterloo Canada

Traffic sensing is crucial to a number of tasks such as traffic management and city road network engineering. We build a traffic sensing system with probe vehicles for metropolitan scale traffic sensing. Each probe vehicle senses its instant speed and position periodically and sensory data of probe vehicles can be aggregated for traffic sensing. However, there is a critical issue that the sensory data contain spatiotemporal vacancies with no reports. This is a result of the naturally uneven distribution of probe vehicles in both spatial and temporal dimensions since they move at their own wills. This paper proposes a new approach based on compressive sensing to large-scale traffic sensing in urban areas. We mine the extensive real trace datasets of taxies in an urban environment with principal component analysis and reveal the existence of hidden structures with sensory traffic data that underpins the compressive sensing approach. By exploiting the hidden structures, an efficient algorithm is proposed for finding the best estimate traffic condition matrix by minimizing the rank of the estimate matrix. With extensive trace-driven experiments, we demonstrate that the proposed algorithm outperforms a number of alternative algorithms. Surprisingly, we show that our algorithm can achieve an estimation error of as low as 20% even when more than 80% of sensory data are not present.

关键词： Vehicles Sensors Probes Roads Compressed sensing Matrix decomposition Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

State/Action-based Fairness Verification for Non-determinism

引用

电子学报(英文版) 2011年第4期20卷 603-606页

作者： XU Guangquan PANG Shanchen GAO Honghao XIAO Yingyuan LI Xiaohong FENG Zhiyong School of Computer Science and Technology Tianjin University Tianjin China Department of Computer Science and Technology Tsinghua University Beijing China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China School of Computer Engineering and Science Shanghai University Shanghai China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

Most of the existing work about fairness verification was carried out by checking the fairness based on state, action, or process respectively. It is hard to resolve the fairness issue for complex software systems, especially in life-critical systems and safety-critical systems. In this paper, we verify the fairness based on both state and action, which is realized mainly by introducing an extended Kripke structure and four kinds of fairness (weak global/local fairness and strong global/local fairness). The experimental results show the superiority of our method by the savings in memory (2.08%) and time consumption (26.45%).

关键词：非确定性基础验证 Kripke结构安全关键系统软件系统公正性消费量

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：