Topic
Software portability
About: Software portability is a research topic. Over the lifetime, 8987 publications have been published within this topic receiving 164922 citations. The topic is also known as: portability.
Papers published on a yearly basis
Papers
More filters
••
16 Jun 2013TL;DR: It is demonstrated that proper tuning could improve the OpenCL portable performance from the current 15% to a potential 67% of the state-of-the-art performance on the Ivy Bridge CPU.
Abstract: We study the performance portability of OpenCL across diverse architectures including NVIDIA GPU, Intel Ivy Bridge CPU, and AMD Fusion APU. We present detailed performance analysis at assembly level on three exemplar OpenCL benchmarks: SGEMM, SpMV, and FFT. We also identify a number of tuning knobs that are critical to performance portability, including threads-data mapping, data layout, tiling size, data caching, and operation-specific factors. We further demonstrate that proper tuning could improve the OpenCL portable performance from the current 15% to a potential 67% of the state-of-the-art performance on the Ivy Bridge CPU. Finally, we evaluate the current OpenCL programming model, and propose a list of extensions that improve performance portability.
62 citations
••
11 Sep 2013TL;DR: The Cloud4SOA solution is introduced, a scalable approach to semantically interconnect heterogeneous PaaS offerings across different Cloud providers that share the same technology.
Abstract: Cloud Platform as a Service (PaaS) is a novel, rapidly growing segment in the Cloud computing market. However, the diversity and heterogeneity of today’s existing PaaS offerings raises several interoperability challenges. This introduces adoption barriers due to the lock-in issues that prevent the portability of data and applications from one PaaS to another, “locking” software developers to the first provider they use. This paper introduces the Cloud4SOA solution, a scalable approach to semantically interconnect heterogeneous PaaS offerings across different Cloud providers that share the same technology. The design of the Cloud4SOA solution, extensively presented in this work, comprises of a set of interlinked collaborating software components and models to provide developers and platform providers with a number of core capabilities: matchmaking, management, monitoring and migration of applications. The paper concludes with the presentation of a proof-of-concept implementation of the Cloud4SOA system based on real-life business scenarios.
62 citations
••
TL;DR: This article propose a training representation based on the dependency paths between entities in a dependency tree which they call lexicalized dependency paths (LDPs), which is fast, efficient and transparent.
Abstract: Log-linear models and more recently neural network models used for supervised relation extraction requires substantial amounts of training data and time, limiting the portability to new relations and domains. To this end, we propose a training representation based on the dependency paths between entities in a dependency tree which we call lexicalized dependency paths (LDPs). We show that this representation is fast, efficient and transparent. We further propose representations utilizing entity types and its subtypes to refine our model and alleviate the data sparsity problem. We apply lexicalized dependency paths to supervised learning using the ACE corpus and show that it can achieve similar performance level to other state-of-the-art methods and even surpass them on several categories.
61 citations
••
11 Jun 2003TL;DR: A JVM architecture designed for very small devices that supports all the CLDC Java platform semantics, including exact garbage collection, dynamic class loading, and verification, and has performance comparable to the reference CLDC implementation available from Sun™.
Abstract: The smallest complete Java™ virtual machine implementations in use today are based on the CLDC standard and are deployed in mobile phones and PDAs. These implementations require several tens of kilobytes. Smaller Java-like implementations also exist, but these involve compromises in Java semantics. This paper describes a JVM™ architecture designed for very small devices. It supports all the CLDC Java platform semantics, including exact garbage collection, dynamic class loading, and verification. For portability and ease of debugging, the entire system is written in the Java language, with key components automatically translated into C and compiled for the target device. The resulting system will run on the next generation of smart cards, and has performance comparable to the reference CLDC implementation available from Sun™.
61 citations
•
30 Mar 2001TL;DR: In this paper, a universal triggerless number portability routing node receives a first call setup message from an end office and examines a first routing number (RN) value contained in the first call-setup message to determine whether the first RN is a home RN value.
Abstract: A universal triggerless number portability routing node receives a first call setup message from an end office. The triggerless number portability routing node may examine a first routing number (RN) value contained in the first call setup message to determine whether the first RN is a home RN value. If the first RN is determined to be a home RN value, a number portability database lookup is performed based on the called party dialed number. Once a number portability lookup is performed, the call setup message is modified to include a second RN value returned by the NP database, and the modified call setup message is routed to a destination node, which may be a tandem gateway or an end office/mobile switching center.
61 citations