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

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Yin, Gang Wang, Tao Yu, Yue Wang, Huaimin Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

In bug tracking system, the high volume of incoming bug reports poses a serious challenge to project managers. Triaging these bug reports manually consumes time and resources which leads to delaying the resolution of important bugs. StackOverow is the most popular crowdsourcing Q&A community with plenty of bug-related posts. In this paper, we explore the correlation between bug severity and the crowd attributes of linked posts. Two typical types of projects' bug repositories are studied here, e.g. Mozilla (user-centric project) and Eclipse (developer-centric project). Our results show that the bug severity is consistent with the crowd- based knowledge both in Mozilla and Eclipse, i.e. the linked posts of severe bugs have higher score etc. in StackOverow than non-severe bugs. This interesting phenomenon inspires us that we can optimize the existing evaluation methods of bug severity by incorporating the crowd-based knowledge from a third-party in future. © 2015 ACM.

关键词： StackOverflow crowd-based knowledge Bugzilla Bug severity

来源：评论

学校读者我要写书评

暂无评论

Exploring the use of @-mention to assist software development in GitHub 15

Exploring the use of @-mention to assist software developmen...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Wang, Huaimin Yin, Gang Wang, Tao Yu, Yue Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

Recently, many researches propose that social media tools can promote the collab.ration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in GitHub. In this paper, we analyze the data from GitHub and give some insights on how @-mention is used in the issues (general- issues and pull-requests). Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collab.ration. In addition to this global study, our study also build a @-network based on the @-mention database we extract. Through the @-network, we can mine the relationships and characteristics of developers in GitHub's issues. © 2015 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

GPP-grep: High-speed regular expression processing engine on general purpose processors

GPP-grep: High-speed regular expression processing engine on...

引用

15th International Symposium on Research in Attacks, Intrusions, and Defenses, RAID 2012

作者： Valgenti, Victor C. Chhugani, Jatin Sun, Yan Satish, Nadathur Kim, Min Sik Kim, Changkyu Dubey, Pradeep School of EECS Washington State University United States Parallel Computing Lab. Intel Corporation United States

ISBN: (纸本)9783642333378

Deep Packet Inspection (DPI) serves as a major tool for Network Intrusion Detection Systems (NIDS) for matching datagram payloads to a set of known patterns that indicate suspicious or malicious behavior. Regular expressions offer rich context for describing these patterns. Unfortunately, large rule sets containing thousands of patterns coupled with high link-speeds leave most regular expression matching methods incapable of matching at real-time without specialized hardware. We present GPP-grep, an NFA-based regular expression processing engine designed for maximum performance on General Purpose Processors. The primary contribution of GPP-grep is the utilization of the data-level parallelism availab.e in modern CPUs to reduce the overhead incurred when tracking multiple states in NFA. In essence, we build and store the NFA in an architecture-friendly manner that exploits locality and then traverse the NFA maximizing the parallelism availab.e and minimizing cache-misses and long-latency memory lookups. GPPgrep demonstrates 24-57x improvement in throughput over standard finite automata techniques on a set of up to 1200 regular-expressions culled from the NIDS Snort, and is within 1.3x of FPGA hardware-based techniques. GPP-grep achieves 2Gbps throughput on a dual-socket commodity CPU system allowing for line-speed evaluation on commodity hardware. © 2012 Springer-Verlag.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Modeling communication in cache-coherent SMP systems - A case study with Xeon Phi

Modeling communication in cache-coherent SMP systems - A cas...

引用

22nd ACM International Symposium on High-Performance parallel and Distributed computing, HPDC 2013

作者： Ramos, Sabela Hoefler, Torsten Computer Architecture Group University of A Coruña A Coruña Spain Scalable Parallel Computing Lab. ETH Zurich Zurich Switzerland

ISBN: (纸本)9781450319102

Most multi-core and some many-core processors implement cache coherency protocols that heavily complicate the design of optimal parallel algorithms. Communication is performed implicitly by cache line transfers between cores, complicating the understanding of performance properties. We developed an intuitive performance model for cache-coherent architectures and demonstrate its use with the currently most scalab.e cache-coherent many-core architecture, Intel Xeon Phi. Using our model, we develop several optimal and optimized algorithms for complex parallel data exchanges. All algorithms that were developed with the model beat the performance of the highly-tuned vendor-specific Intel OpenMP and MPI libraries by up to a factor of 4.3. The model can be simplified to satisfy the tradeoff between complexity of algorithm design and accuracy. We expect that our model can serve as a vehicle for advanced algorithm design. © 2013 ACM.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Improving rating estimation in recommender using demographic data and expert opinions

Improving rating estimation in recommender using demographic...

引用

2011 IEEE 2nd International Conference on Software Engineering and Service Science, ICSESS 2011

作者： Yun, Long Yang, Yan Wang, Jing Zhu, Ge Dept. of Computer Science and Technology Heilongjiang University Key Lab. of Database and Parallel Computing Heilongjiang Province Harbin China

ISBN: (纸本)9781424496969

Memory-based collab.rative filtering algorithms have been widely adopted in many popular recommender systems, however the rating data are very sparse, which affects prediction accuracy greatly. To solve this problem, we use expert opinions to improve prediction accuracy. Firstly, we propose a novel similarity measure in order to highlight users' background. Then, combining users' ratings with expert opinions, the prediction get a right balance in both expert professional opinions and similar users. Finally, since SVD-based collab.rative filtering algorithms shows good performance on the prevention of noise, we use it to smooth the prediction. Experiments of MovieLens have shown that our proposed method improves recommendation quality obviously. © 2011 IEEE.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

Optimizing compiler for shared-memory multiple SIMD architecture 06

Optimizing compiler for shared-memory multiple SIMD architec...

引用

LCTES 2006 - 2006 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems

作者： Zhang, Weihua Qian, Xinglong Wang, Ye Zang, Binyu Zhu, Chuanqi Parallel Processing Institute Fudan University Shanghai China Architecture Key Lab. Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)159593362X

With the rapid growth of multimedia and game, these applications put more and more pressure on the processing ability of modern processors. Multiple SIMD architecture is widely used in multimedia processing field as a multimedia accelerator. With the consideration of power consumption and chip size, shared memory multiple SIMD architecture is mainly used in embedded SOCs. In order to further fit mobile environment, there is the constraint of limited register number as well. Although shared memory multiple SIMD architecture simplify the chip design, these constraints are the major obstacles to map the real multimedia applications to these architectures. Until now, to our best knowledge, there is little research on the optimizing techniques for shared memory multiple SIMD architecture. In this paper, we present a compiler framework, which aims at automatically generating high performance codes for shared memory multiple SIMD architecture. In this framework, we reduce the competition of shared data bus through Increasing the register locality, improve the utilization of data bus by read-only data vector replication and solve the problem of limited register number through a resource allocation algorithm. The framework also handlers the issues concerning on data transformation. As the experimental results shown, this framework is successful in mapping real multimedia applications to shared memory multiple SIMD architecture. It leads to an average speedup by a factor of 3.19 and an average utilization of SM-SIMD architecture with 8 SIMD units by a factor of 52.6%. Copyright © 2006 ACM.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

An accelerated block-parallel Newton method via overlapped partitioning

引用

Lecture Notes in Computational Science and Engineering 2005年 40卷 547-554页

作者： Chen, Yurong Lab. of Parallel Computing Institute of Software CAS China

ISBN: (纸本)3540225234

This paper presents an overlapped block-parallel Newton method for solving large nonlinear systems. The graph partitioning algorithms are first used to partition the Jacobian into weakly coupled overlapping blocks. Then the simplified Newton iteration is directly performed, with the diagonal blocks and the overlapping solutions assembled in a weighted average way at each iteration. In the algorithmic implementation, an accelerated technique has been proposed to reduce the number of iterations. The conditions under which the algorithm is locally and semi-locally convergent are studied. Numerical results from solving power flow equations are presented to support our study.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

A GPU-based high-throughput image retrieval algorithm 5

A GPU-based high-throughput image retrieval algorithm

引用

5th Workshop on General-Purpose Computation on Graphics Processing Units, GPGPU-5 - Held in Cooperation with ACM ASPLOS XVII

作者： Zhu, Feiwen Chen, Peng Yang, Donglei Zhang, Weihua Chen, Haibo Zang, Binyu State Key Lab. of ASIC and System Fudan University China Parallel Processing Institute Fudan University China Architecture Key Lab. Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781450312332

With the development of Internet and cloud computing, multimedia data, such as images and videos, has become one of the most common data types being processed. As the scale of multimedia data being still increasing, it is vitally important to efficiently extract useful information from such a huge amount of multimedia data. However, due to the complexity of the core algorithms, multimedia retrieval applications are not only data intensive but also computationally intensive. Therefore, it has been a major challenge to accelerate the processing speed of such applications to satisfy the real-time requirement. As Graphic Processing Unit (GPU) has entered the general-propose computing domain (GPGPU), it has become one of the most popular accelerators for the applications with real-time requirements. In this paper, we parallelize a widely-used image retrieval algorithm called SURF on GPGPU, which is the core algorithm for many video and image retrieval applications. We first analyze the parallelism within SURF to guarantee that there are sufficient tasks being mapped to the large-scale computation resources in GPGPU. We then exploit some inherent GPGPU characteristics, such as 2D memory, to further boost the performance. Finally, we provide some optimization to the cooperation between CPU and GPGPU, which is generally ignored in previous designs. Experimental results show that our parallelization and optimization achieve a throughput of 340.5 frames/s on a NVIDIA GTX295 GPGPU, which is 15X faster than the maximal optimized CPU version. Compared to CUDA SURF, a state-of-the-art parallelization of SURF on GPGPU, our system achieves a speedup by a factor of 2.3X. © 2012 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

EvAnT: Analysis and checking of event traces for wireless sensor networks

EvAnT: Analysis and checking of event traces for wireless se...

引用

2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy computing, SUTC 2008

作者： Woehrle, Matthias Plessl, Christian Lim, Roman Beutel, Jan Thiele, Lothar ETH Zurich Computer Engineering and Networks Lab. 8092 Zurich Switzerland University of Paderborn Paderborn Center for Parallel Computing 33102 Paderborn Germany

ISBN: (纸本)9780769531588

Testing and verification methodologies for Wireless Sensor Networks (WSN) systems in pre-deployment are vital for a successful deployment. Increased visibility of the internal state of a WSN application is established by instrumenting the application for logging execution traces at runtime. While the interpretation of the event traces is application-specific, a common method for analysis can be devised. This method should allow for a concise formulation of explorative queries to determine the occurrence and the cause of functional or performance problems. The contribution of this paper is an event analysis methodology that is implemented in the EvAnT framework. EvAnT allows for specifying queries that are executed on the collected traces. EvAnT is specifically tailored to WSN testing and debugging. We demonstrate the applicability of EvAnT by a case study in a building monitoring project. © 2008 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Data-race detection: The missing piece for an end-to-end semantic equivalence checker for parallelizing transformations of array-intensive programs 3

Data-race detection: The missing piece for an end-to-end sem...

引用

3rd ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, ARRAY 2016

作者： Banerjee, Kunal Banerjee, Soumyadip Sarkar, Santonu Dept of Computer Sc and Engg IIT Kharagpur India Dept of CSIS BITS Pilani-Goa India Intel Parallel Computing Lab. Bangalore India

ISBN: (纸本)9781450343848

The parallelizing transformation (hand-crafted or compiler-assisted) is error prone as it is often performed without verifying any semantic equivalence with the sequential counterpart. Even when the parallel program can be proved to be semantically equivalent with its corresponding sequential program, detecting data-race conditions in the parallel program remains a challenge. In this paper, we propose a formal verification approach that can detect data-race conditions while verifying the computational semantic equivalence of parallelizing loop transformations. We propose a coloured array data dependence graph (C-ADDG) based modeling of a program for verification of program equivalence as well as data-race condition detection across parallel loops. We have tested our tool on a set of Rodinia and PLuTo+ benchmarks and shown that our method is sound, whereby the method does not produce any false-positive program equivalence or data-race condition. © 2016 ACM.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：