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

21st Annual IEEE Symposium on High-Performance Interconnects (HOTI)

作者： Kandalla, K. Venkatesh, A. Hamidouche, K. Potluri, S. Bureddy, D. Panda, D. K. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9780769551036

The emergence of co-processors such as Intel Many Integrated Cores (MICs) is changing the landscape of supercomputing. The MIC is a memory constrained environment and its processors also operate at slower clock rates. Furthermore, the communication characteristics between MIC processes are also different compared to communication between host processes. Communication libraries that do not consider these architectural subtleties cannot deliver good communication performance. The performance of MPI collective operations strongly affect the performance of parallel applications. Owing to the challenges introduced by the emerging heterogeneous systems, it is critical to fundamentally re-design collective algorithms to ensure that applications can fully leverage the MIC architecture. In this paper, we propose a generic framework to optimize the performance of important collective operations, such as, MPI_Bcast, MPI_Reduce and MPI_Allreduce, on Intel MIC clusters. We also present a detailed analysis of the compute phases in reduce operations for MIC clusters. To the best of our knowledge, this is the first paper to propose novel designs to improve the performance of collectives on MIC clusters. Our designs improve the latency of the MPI_Bcast operation with 4,864 MPI processes by up to 76%. We also observe up to 52.4% improvements in the communication latency of the MPI_Allreduce operation with 2K MPI processes on heterogeneous MIC clusters. Our designs also improve the execution time of the WindJammer application by up to 16%.

关键词： application program interfaces clocks coprocessors message passing multiprocessing systems parallel architectures performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Intralayer Communication for Tree-Based Overlay Networks

Intralayer Communication for Tree-Based Overlay Networks

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Hilbrich, Tobias Protze, Joachim de Supinski, Bronis R. Schulz, Martin Mueller, Matthias S. Nagel, Wolfgang E. Tech Univ Dresden D-01062 Dresden Germany Rhein Westfal TH Aachen Aachen Germany Lawrence Livermore Natl Lab Livermore CA USA

ISBN: (纸本)9780769551173

While various HPC tools use Tree-Based Overlay Networks (TBONs) to increase their scalability, some use cases do not map well to a tree-based hierarchy. We provide the concept of intralayer communication to improve this situation, where nodes in a specific hierarchy layer may exchange messages directly with each other. This concept targets data preprocessing that allows tool developers to avoid load imbalances in higher hierarchy levels. We implement intralayer communication within the Generic Tools Infrastructure (GTI) that provides TBON services, as well as a high-level abstraction to ease the creation of scalable runtime tools. An extension of GTI's abstractions allows simple and efficient use of intralayer communication. We demonstrate this capability with a runtime message matching tool for MPI's point-to-point communication, which we evaluate in an application study with up to 16,384 processes. Low overheads for two benchmark suites show the applicability of our approach, while a stress test demonstrates close to constant overheads across scales. The stress test measurements demonstrate that intralayer communication reduces application slowdown by two orders of magnitude at 2,048 processes, compared to a previous TBON-based implementation.

关键词： application program interfaces message passing parallel processing trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

How to Drill Down to ReST APIs: Resource Harvesting with a Pattern Tool

How to Drill Down to ReST APIs: Resource Harvesting with a P...

引用

13th IEEE International Symposium on Web Systems Evolution (WSE)

作者： Hartikainen, Mikko Laitkorpi, Markku Ruokonen, Anna Systa, Tarja Tampere Univ Technol FIN-33101 Tampere Finland

ISBN: (纸本)9781457707001

REST has become a popular architectural style among service providers. It is considered as an easy way to design and consume Web services. REST can be realized as using HTTP PUT, POST, and GET operations. However, the focus on the implementation technique often leads to ignoring the original REST constraints and definitions proposed by R. Fielding. Thus, this way of thinking might result in misuse of REST. In addition, less emphasis is put on designing good REST APIs, which indeed is not a trivial task. In this paper, we propose a questionnaire-based method, motivated by speech-act theory, to harvest the essential API concepts and their relationships from the functional service requirements. We present our pattern-based implementation of the method. We define a reusable REST API pattern, which can be applied in different contexts to produce an API model according to the REST design principles. The main benefit of the questionaire-based method is on shifting the focus from an operation-based to a resource-oriented mindset. The paper includes an empirical evaluation.

关键词： Adaptation models Context Educational institutions GET HTTP PUT Image color analysis POST ReST API Servers Software Unified modeling language Web services Web services application program interfaces pattern tool questionnaire based method resource harvest

来源：评论

学校读者我要写书评

暂无评论

Measuring Inappropriate Generosity with Access Modifiers in Java Systems

Measuring Inappropriate Generosity with Access Modifiers in ...

引用

Joint Conference of the 22nd International Workshop on Software Measurement / 7th International Conference on Software Process and Product Measurement (IWSM-MENSURA)

作者： Zoller, Christian Schmolitzky, Axel Univ Hamburg Dept Informat Hamburg Germany

ISBN: (纸本)9780769548401;9781467331272

Every element of a software architecture, e. g. a subsystem, package, or class, should have a well-defined interface that exposes or hides its subelements according to the principles of information hiding and encapsulation. Similar to other object-oriented programming languages, Java supports defining interfaces on several levels. The accessibility of types, methods, and fields can be restricted by using access modifiers. With these modifiers, developers are able to define interfaces of packages and classes tailored for different groups of clients. However, in programming practice, types and members seem to be often declared with too generous access modifiers, i.e. they are accessible by more clients than necessary. This can lead to unwanted dependencies and software quality degradation. We developed an approach to measuring the usage of access modifiers for types and methods in Java by defining two new software metrics: Inappropriate Generosity with Accessibility of Types (IGAT) and Inappropriate Generosity with Accessibility of Methods (IGAM). Furthermore, we created a tool called AccessAnalysis that calculates and displays these metrics. Using AccessAnalysis, we conducted a survey on twelve open source Java projects. The results support our assumption that access modifiers are often chosen more generously than necessary. On average, around one third of all type and method access modifiers fall into this category. Especially top-level types are almost always declared as public, so that package interfaces typically expose more types than necessary. Only 2% of all investigated top-level types are encapsulated inside their package.

关键词： Java application program interfaces data encapsulation object-oriented programming public domain software software architecture software metrics software packages software quality software tools

来源：评论

学校读者我要写书评

暂无评论

Source code recognition by graph algorithm

Source code recognition by graph algorithm

引用

14th International Carpathian Control Conference (ICCC)

作者： Bublik, Tomas Virius, Miroslav Czech Tech Univ Fac Nucl Sci & Phys Engn CR-11519 Prague Czech Republic

ISBN: (纸本)9781467344906;9781467344883

This paper describes an option how to detect a desired Java code snippet in a large number of Java source files. The scripting language Scripthon is used to describe the desired section. Next, from this piece, an abstract tree is created, and it is compared to the other trees which are created from the Java source codes. The Java Compiler API is used to obtain the trees from the Java source codes.

关键词： Java application program interfaces authoring languages program compilers trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Payback for SOA adopters

引用

Information Professional 2007年第5期4卷 26-27页

作者： Edwards, Chris

The service-oriented architecture (SOA) approach to building IT systems has, for a number of people, moved out of the trial phase and onto real-life deployments. Companies are basing their entire IT infrastructure around textbook SOA principles. However, despite all the interest, some thorny issues with SOA remain. Many vendors have produced tools and support products for SOA-based systems, but few of these tools address the core changes that SOA entails: it's harder than it seems to take applications and APIs and convert that into reusable services. The vendors have instead focused on supporting applications that have already been converted to use SOA principles. You can see how that works for people and the kinds of tools that need to be considered.

关键词： IT infrastructure service-oriented architecture business data processing Software engineering techniques Business and administration General utility programs IT systems software architecture application program interfaces API

来源：评论

学校读者我要写书评

暂无评论

Not just another portal, not just another digital library: A portrait of Europeana as an application program interface

引用

IFLA JOURNAL-INTERNATIONAL FEDERATION OF LIBRARY ASSOCIATIONS 2010年第1期36卷 61-69页

作者： Concordia, Cesare Gradmann, Stefan Siebinga, Sjoerd Inst Informat Sci & Technol ISTI CNR Networked Multimedia Informat Syst Lab Pisa Italy Humboldt Univ Lib & Informat Sci Special Focus Knowledge Manage Berlin Inst Lib & Informat Sci B SLIS Unter Linden 6 D-10099 Berlin Germany Europeana Dev The Hague Netherlands

To the general public, Europeana is primarily perceived as a portal exposing a great amount of cultural heritage information. Even though this perception is not entirely misleading, the main goal of Europeana is rather to build an open services platform enabling users and cultural institutions to access and manage a large collection of surrogate objects representing digital and digitized content via an application program interface (API). The paper covers some details of the overall data space schema, of the API description and of the Europeana Portal implementation;it also discusses use cases and the mental approach that users, in particular cultural institutions, should adopt to completely exploit the potential of the Europeana services platform together with a discussion of related risks. The authors represent key players in the Europeana specification, development and implementation process currently under way.

关键词： Europeana application program interfaces cultural heritage information open services platforms web portals semantic web

来源：评论

学校读者我要写书评

暂无评论

Data link provider interface and its application

Data link provider interface and its application

引用

IEEE International Conference on Intelligent Processing Systems

作者： Yang, H JiangSu Automat Res Inst Dept Software Engn Lian Yungang Jiangsu Peoples R China

ISBN: (纸本)0780342534

DLPI that means Data Link Provider Interface is a standard interface between data link service providers and users, which is based on STREAMS mechanism. It implements three kinds of communication service at data link layer: connection-oriented service, acknowledged connectionless service, and unacknowledged connectionless service. This paper gives a brief introduction of DLPI, and describes the communication service and primitive provided by DLPI, at last an application example is given to illustrate its application in network communication.

关键词： application program interfaces computer networks network interfaces open systems access protocols Data Link Provider Interface data link service provider data link service users STREAMS mechanism communication service data link layer connection-oriented service acknowledged connectionless service unacknowledged connectionless service communication primitive network communication

来源：评论

学校读者我要写书评

暂无评论

Automated analysis of security protocols with global state 35

Automated analysis of security protocols with global state

引用

35th IEEE-Computer-Society Workshop on Security and Privacy (SP)

作者： Kremer, Steve Kunnemann, Robert INRIA Nancy GrandEst & Loria Villers Les Nancy France Tech Univ Darmstadt Dept Comp Sci Darmstadt Germany INRIA Paris Rocquencourt Paris France

ISBN: (纸本)9781479946860

Security APIs, key servers and protocols that need to keep the status of transactions, require to maintain a global, non-monotonic state, e.g., in the form of a database or register. However, existing automated verification tools do not support the analysis of such stateful security protocols sometimes because of fundamental reasons, such as the encoding of the protocol as Horn clauses, which are inherently monotonic. An exception is the recent tamarin prover which allows specifying protocols as multiset rewrite (msr) rules, a formalism expressive enough to encode state. As multiset rewriting is a "low-level" specification language with no direct support for concurrent message passing, encoding protocols correctly is a difficult and error-prone process. We propose a process calculus which is a variant of the applied pi calculus with constructs for manipulation of a global state by processes running in parallel. We show that this language can be translated to msr rules whilst preserving all security properties expressible in a dedicated first-order logic for security properties. The translation has been implemented in a prototype tool which uses the tamarin prover as a backend. We apply the tool to several case studies among which a simplified fragment of PKCS#11, the Yubikey security token, and an optimistic contract signing protocol.

关键词： Horn clauses application program interfaces cryptographic protocols formal verification message passing pi calculus specification languages PKCS 11 Yubikey security token automated security protocol analysis automated verification tools concurrent message passing encoding protocols error-prone process first-order logic key servers low-level specification language msr rules multiset rewrite rules multiset rewriting nonmonotonic state optimistic contract signing protocol process calculus prototype tool security API security properties tamarin prover Analytical models Calculus Contracts Mathematical model Protocols Security Semantics Multiset rewriting Protocol Analysis Security APIs pi calculus Horn clauses protocols lysyl-arginyl-alanyl-lysyl-alanyl-lysyl-threonyl-threonyl-lysyl-lysyl-arginine message passing application programming interfaces specification description language cryptographic protocols contract Calculus Calculi Formal verification ANALYSIS MODELS Semantics Security

来源：评论

学校读者我要写书评

暂无评论

Parallelizing k-means Algorithm for 1-d Data Using MPI 23

Parallelizing k-means Algorithm for 1-d Data Using MPI

引用

23rd IEEE International Conference on Enabling Technologies, Infrastructure for Collaborative Enterprises (WETICE)

作者： Savvas, Ilias K. Sofianidou, Georgia N. TEI Thessaly Dept Comp Sci & Engn Larisa Greece

ISBN: (纸本)9781479942497

Nowadays, colossal amount of information is produced by computational systems and electronic instruments such as telescopes, medical devices and so on. To explore these petabytes of data, new fast algorithms must be discovered or old ones may be redesigned. One of the most popular and useful techniques in order to discover and extract information from data pools is clustering, and k-means is an algorithm which clusters data according its characteristics. Its main disadvantage is its computational complexity which makes the technique very difficult to apply on big data sets. Although k-means is a very well studied technique, a fully parallel version of it has not been explored yet. In this work, a parallel version of the k-means is presented for 1-d objects. The experimental results obtained are inline with the theoretical outcome and prove both the correctness and the effectiveness of the technique.

关键词： Big Data application program interfaces computational complexity information retrieval message passing parallel algorithms pattern clustering 1D data MPI big data sets computational systems data pools electronic instruments information discovery information extraction medical devices message passing interface parallelizing k-means algorithm telescopes Algorithm design and analysis Clustering algorithms Computational complexity Data mining Equations Peer-to-peer computing message passing complexity classes ELECTRONIC INSTRUMENTS information retrieval mannose phosphate isomerase remote procedure calls Algorithm design and analysis big data application programming interfaces Peer to peer computing information discovery Telescopes Medical device Clustering algorithms Information Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：