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

32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010

作者： Pankratius, Victor Philippsen, Michael 76131 Karlsruhe Germany University of Erlangen-Nuremberg 91058 Erlangen Germany

ISBN: (纸本)9781605587196

This paper provides a summary of the Third International workshop on Multicore Software Engineering (IWMSE 2010). Motivated by multicore and manycore processors that are available on every desktop, software engineers need to exploit parallelism to make applications run faster. At the same time, programmers are facing many challenges due to the complexity of parallel programming. The workshop brought together researchers and practitioners to advance the state-of-the-art in software engineering for multicore and manycore systems. The contributions covered topics ranging from programming models, performance engineering, parallel patterns, fault-tolerance, to testing. © 2010 Copyright is held by author/owner(s).

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

KAdvice: Infering synchronization patterns from an existing codebase

KAdvice: Infering synchronization patterns from an existing ...

引用

2nd International workshop on Recommendation Systems for Software Engineering, RSSE 2010, in Conjunction with the 32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010

作者： Schmidt, Alexander Polze, Andreas Operatings Systems and Middleware Group Hasso Plattner Institute Prof.-Dr.-Helmert-Str. 2-3 14482 Potsdam Germany

ISBN: (纸本)9781605589749

Operating system kernels are complex software systems. The kernels of todays mainstream OSs, such as Linux or Windows, are composed from a number of modules, which contain code and data. Even when providing synchronous interfaces (APIs) to the programmer, large portions of the OS kernel operate in an asynchronous manner. Synchronizing access to kernel data structures therefore is a central problem in OS kernels running on todays multicore and multiprocessor hardware. With the need to utilize future multi- and manycore processors, managing the synchronization problem becomes central to all multithreaded control-parallel applications. Since only little software is written from scratch, understanding the intended use of locking constructs and their relation to shared data structures will become critical to all programmers. Built upon our experiences with developing code inside the Windows kernel, we have developed the KAdvice approach, which helps to analyze locking structures in an existing code- base. KAdvice applies static analysis to call graphs and code dependencies to recommend appropriate locking patterns when accessing certain data structures. KAdvice has itself proven very useful in context of students' programming projects based upon the Windows Research Kernel (WRK). However, our approach is more general and applicable not only to OS kernels but to control-parallel software in general.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Analysis of design patterns for composite telco services

Analysis of design patterns for composite telco services

引用

2010 14th International Conference on Intelligence in Next Generation Networks: "Weaving Applications Into the Network Fabric", ICIN 2010 - 2nd International workshop on Business Models for Mobile Platforms, BMMP 10

作者： Baglietto, Pierpaolo Maresca, Massimo Stecca, Michele Manzalini, Antonio Minerva, Roberto Moiso, Corrado CIPI University of Genoa and Padua Genova Italy Telecom Italia - Strategy and Innovation Torino Italy

ISBN: (纸本)9781424474455

The adoption of IT-based interfaces to monitor and control telco capabilities is a consolidated approach. In such a scenario the end-users design composite services that orchestrate functions implemented through one or more resources managed by telecom operators. In addition to the issues that have to be faced to support the design of composite services in general, in this case it is also necessary to face issues that are specific to the telco domain. In fact, telco services strongly rely on the processing of asynchronous events generated by resources;moreover, they usually handle large and dynamic sets of concurrent processes that execute long-running transactions each of which includes interactions between the composite service and the telco capabilities. The complexity of the telco domain suggests to define a set of patterns to ease the development of composite services. The goal of this paper is to propose such patterns and to show how they can be implemented both as plain Java objects and as BPEL processes. The pattern based approach is illustrated by means of a service which takes advantage of the combined use of multiple patterns. Moreover, the paper suggests some improvements on the definition of the interfaces and on the reference model for the development of composite services. ©2010 IEEE.

关键词： BPEL processes Design patterns IT-based interfaces Interaction patterns Java Java objects Orchestration Service Composition composite services composite telco services concurrent processes design patterns long-running transactions object-oriented programming telco capability telecom operators telecommunication computing telecommunication services

来源：评论

学校读者我要写书评

暂无评论

Session-based programming for parallel algorithms: Expressiveness and performance 2

Session-based programming for parallel algorithms: Expressiv...

引用

2nd International workshop on programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2009

作者： Bejleri, Andi Hu, Raymond Yoshida, Nobuko Imperial College London United Kingdom

This paper investigates session programming and typing of benchmark examples to compare productivity, safety and performance with other communications programming languages. parallel algorithms are used to examine the above aspects due to their extensive use of message passing for interaction, and their increasing prominence in algorithmic research with the rising availability of hardware resources such as multicore machines and clusters. We contribute new benchmark results for SJ, an extension of Java for type-safe, binary session programming, against MPJ Express, a Java messaging system based on the MPI standard. In conclusion, we observe that (1) despite rich libraries and functionality, MPI remains a low-level API, and can suffer from commonly perceived disadvantages of explicit message passing such as deadlocks and unexpected message types, and (2) the benefits of high-level session abstraction, which has significant impact on program structure to improve readability and reliability, and session type-safety can greatly facilitate the task of communications programming whilst retaining competitive performance. © A. Bejleri & R. Hu & N. Yoshida.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Spare Optimization Using Genetic Algorithms

Spare Optimization Using Genetic Algorithms

引用

International workshop on Intelligent Systems and Applications, ISA

作者： Xiaoli Zou Dept. of Civil Eng. Wuhan Polytech. Univ. Wuhan China

Spare optimization models for systems with components connected in series and parallel are presented. The component availability at any time is obtained through Poisson process theory and the availability of the series-parallel system is written by system reliability analysis method. The objective of the optimization problem is to maximize the availability of the system satisfying the constraint on cost. Genetic algorithms are used to find the optimal amount of spares for each component. Finally, two illustrative examples are given.

关键词： Genetic algorithms Availability Dynamic programming Constraint optimization Aerospace industry Space technology Linear programming Civil engineering Reliability Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Mining Frequent patterns from Software Defect Repositories for Black-Box Testing

Mining Frequent Patterns from Software Defect Repositories f...

引用

International workshop on Intelligent Systems and Applications, ISA

作者： Ning Li Zhanhuai Li Lijun Zhang School of Computer Science and Technology Northwestern Polytechnical University Xi'an China

Software defects are usually detected by inspection, black-box testing or white-box testing. Current software defect mining work focuses on mining frequent patterns without distinguishing these different kinds of defects, and mining with respect to defect type can only give limited guidance on software development due to overly broad classification of defect type. In this paper, we present four kinds of frequent patterns from defects detected by black-box testing (called black-box defect) based on a kind of detailed classification named ODC-BD (Orthogonal Defect Classification for Blackbox Defect). The frequent patterns include the top 10 conditions (data or operation) which most easily result in defects or severe defects, the top 10 defect phenomena which most frequently occur and have a great impact on users, association rules between function modules and defect types. We aim to help project managers, black-box testers and developers improve the efficiency of software defect detection and analysis using these frequent patterns. Our study is based on 5023 defect reports from 56 large industrial projects and 2 open source projects.

关键词： Software testing Data mining Itemsets Association rules programming Inspection Software development management Open source software Pattern analysis Software quality

来源：评论

学校读者我要写书评

暂无评论

An empirical study on harmonizing classification precision using IE patterns

An empirical study on harmonizing classification precision u...

引用

International Conference on Software Engineering and Data Mining (SEDM)

作者： Lay-Ki Soon Kyu-Baek Hwang Sang Ho Lee Faculty of Information Technology Multimedia University Cyberjaya Selangor Darul Ehsan Malaysia Department of Computing Soongsil University Seoul South Korea

ISBN: (纸本)9781424473243;9788988678220;9788988678213

Web pages are conventionally represented by the words found within the contents for classification purpose. However, word-based web page representation suffers several limitations such as synonymy and homonymy. Motivated by the limitations of word-based representation, we explore the potential of representing web pages using information extraction patterns, in addition to words that are identified within the web contents. In this paper, we share the results as well as the findings learned from our experiments. Our empirical study conducted using WebKB dataset indicates that the addition of information extraction patterns in web page representation helps to improve the classification precision, especially in the categories which have much diversified web content.

关键词： Web pages Data mining Crawlers Information retrieval parallel programming Computer science Search engines Information technology Multimedia computing Web mining

来源：评论

学校读者我要写书评

暂无评论

Refactoring a language for parallel computational chemistry

Refactoring a language for parallel computational chemistry

引用

2nd workshop on Refactoring Tools, WRT '08, in conjunction with the Conference on Object Oriented programming Systems Languages and Applications, OOPSLA 2008

作者： Sanders, Beverly A. Deumens, Erik Lotrich, Victor Ponton, Mark Department of Computer and Information Science and Engineering University of Florida United States Quantum Theory Project University of Florida United States ACES QC Gainesville FL United States

ISBN: (纸本)9781605583396

We describe a project to provide refactoring support for the SIAL programming language. SIAL is a domain specific parallel programing language designed to express quantum chemistry computations. It incorporates language support for the loop parallelism and distributed array parallel design patterns. In contrast to refactorings typically undertaken for object-oriented programs which have the goal of improving the code structure, SIAL refactorings are usually done to improve the performance or to allow larger problems to be solved. Copyright © 2008 ACM.

关键词： Computational chemistry

来源：评论

学校读者我要写书评

暂无评论

OpenMP implementation of SPICE3 circuit simulator

引用

INTERNATIONAL JOURNAL OF parallel programming 2007年第5期35卷 493-505页

作者： Weng, Tien-Hsiung Perng, Ruey-Kuen Chapman, Barbara Providence Univ Dept Comp Sci & Informat Engn Taichung Taiwan Univ Houston Dept Comp Sci Houston TX 77204 USA

In this paper, we describe our experience of creating an OpenMP implementation of the SPICE3 circuit simulator program. Given the irregular patterns of access to dynamic data structures in the SPICE code, a parallelization using current standard OpenMP directives is impossible without major rewriting of the original program. The aim of this work is to present a case study showing the development of a shared memory parallel code with minimum effort. We present two implementations, one with minimal code modification and one without modification to the original SPICE3 program using Intel's taskq construct. We also discuss the results of the case study in terms of what future compiler tools may be needed to help OpenMP application developers with similar porting goals. Our experiments using SPICE3, based on SRAM model simulation, were compiled by the SUN compiler running on a SunFire V880 UltraSPARC-III 750 MHz and by the Intel icc compiler running on both an IBM Itanium with four CPUs and Intel Xeon of two processors machines. The results are promising.

关键词： OpenMP SPICE circuit simulator shared-memory programming model

来源：评论

学校读者我要写书评

暂无评论

A comparative characterization of communication patterns in applications using MPI and shared memory on an IBM SP2 2nd

引用

2nd International workshop on Communication, Architecture, and Applications for Network-Based parallel Computing (CANPC 98)

作者： Karlsson, S Brorsson, M Univ Lund Dept Informat Technol SE-22100 Lund Sweden

ISBN: (纸本)3540641408

In this paper we analyze the characteristics of communication in three different applications, FFT, Barnes and Water, on an IBM SP2. We contrast the communication using two different programming models: message-passing, MPI, and shared memory, represented by a state-of-the-art distributed virtual shared memory package, TreadMarks. We show that while communication time and busy times are comparable for small systems, the communication patterns are fundamentally different leading to poor performance for TreadMarks-based applications when the number of processors increase. This is due to the request/reply technique used in TreadMarks that results in a large fraction of very small messages. However, if the application can be tuned to reduce the impact of small message communication it is possible to achieve acceptable performance at least up to 32 nodes. Our measurements also show that TreadMarks programs tend to cause a more even network load compared to MPI programs.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：