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

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Ioan Toma Dumitru Roman Kashif Iqbal Dieter Fensel Stefan Decker Juergen Hofer Digital Enterprise Research Institute Galway Ireland Distributed and Parallel Systems Group University of Innsbruck Innsbruck Austria

Web services and Grid computing are technologies with a great impact these days. Both technologies are taking a syntactical based approach to describe services, and therefore, limited support is provided for service related tasks like: discovery, composition, etc. Semantic Web services try to overcome the limitations of syntactical based approaches by adding semantics to services descriptions. One of the most salient initiatives in Semantic Web services area is the Web Service Modeling Ontology (WSMO). WSMO provides a conceptual model and languages to express semantic descriptions of services. We believe that WSMO, the conceptual model, and WSML, the associated family of languages, with some extensions and/or restrictions could be the solution for semantically describe services in Grid environment.

关键词： Web services Grid computing Semantic Web Power engineering computing Ontologies Computer science Application software Electronic commerce distributed computing Service oriented architecture

来源：评论

学校读者我要写书评

暂无评论

COMPUTED TOMOGRAPHY DATA COLOURING BASED on PHOTOGRAMMETRIC IMAGES 24

COMPUTED TOMOGRAPHY DATA COLOURING BASED on PHOTOGRAMMETRIC ...

引用

2020 24th ISPRS Congress - Technical Commission II

作者： Zhan, K. Song, Y. Fritsch, D. Mammadov, G. Wagner, J. Adaptive Structures in Aerospace Engineering University of Stuttgart Germany Oceanic Machine Vision Group GEOMAR Helmholtz Centre for Ocean Research Kiel Germany Institute for Photogrammetry University of Stuttgart Germany Institute for Parallel and Distributed Systems University of Stuttgart Germany

Nowadays various methods and sensors are available for 3D reconstruction tasks;however, it is still necessary to integrate advantages of different technologies for optimizing the quality 3D models. Computed tomography (CT) is an imaging technique which takes a large number of radiographic measurements from different angles, in order to generate slices of the object, however, without colour information. The aim of this study is to put forward a framework to extract colour information from photogrammetric images for corresponding Computed Tomography (CT) surface data with high precision. The 3D models of the same object from CT and photogrammetry methods are generated respectively, and a transformation matrix is determined to align the extracted CT surface to the photogrammetric point cloud through a coarse-to-fine registration process. The estimated pose information of images to the photogrammetric point clouds, which can be obtained from the standard image alignment procedure, also applies to the aligned CT surface data. For each camera pose, a depth image of CT data is calculated by projecting all the CT points to the image plane. The depth image is in principle should agree with the corresponding photogrammetric image. The points, which cannot be seen from the pose, but are also projected on the depth image, are excluded from the colouring process. This is realized by comparing the range values of neighbouring pixels and finding the corresponding 3D points with larger range values. The same procedure is implemented for all the image poses to obtain the coloured CT surface. Thus, by using photogrammetric images, we achieve a coloured CT dataset with high precision, which combines the advantages from both methods. Rather than simply stitching different data, we deep-dive into the photogrammetric 3D reconstruction process and optimize the CT data with colour information. This process can also provide an initial route and more options for other data fusion processes.

关键词： Photogrammetry

来源：评论

学校读者我要写书评

暂无评论

ExPERT: Pareto-Efficient Task Replication on Grids and a Cloud

ExPERT: Pareto-Efficient Task Replication on Grids and a Clo...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： Orna Agmon Ben-Yehuda Assaf Schuster Artyom Sharov Mark Silberstein Alexandru Iosup Technion-Israel Institute of Technology Haifa Israel Parallel and Distributed Systems Group Technical University Delft Netherlands

Many scientists perform extensive computations by executing large bags of similar tasks (BoTs) in mixtures of computational environments, such as grids and clouds. Although the reliability and cost may vary considerably across these environments, no tool exists to assist scientists in the selection of environments that can both fulfill deadlines and fit budgets. To address this situation, we introduce the Expert BoT scheduling framework. Our framework systematically selects from a large search space the Pareto-efficient scheduling strategies, that is, the strategies that deliver the best results for both make span and cost. Expert chooses from them the best strategy according to a general, user-specified utility function. Through simulations and experiments in real production environments, we demonstrate that Expert can substantially reduce both make span and cost in comparison to common scheduling strategies. For bioinformatics BoTs executed in a real mixed grid + cloud environment, we show how the scheduling strategy selected by Expert reduces both make span and cost by 30%-70%, in comparison to commonly-used scheduling strategies.

关键词： Reliability Throughput Processor scheduling Mathematical model Computational modeling Equations Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of the PVFS2 Architecture

Performance Evaluation of the PVFS2 Architecture

引用

Euromicro Conference on parallel, distributed and Network-Based Processing

作者： Julian M. Kunkel Thomas Ludwig Germany Institute of Computer Science Research Group Parallel and Distributed Systems Ruprecht-Karls-Universität Heidelberg Germany

As the complexity of parallel file systems' software stacks increases it gets harder to reveal the reasons for performance bottlenecks in these software layers. This paper introduces a method which eliminates the influence of the physical storage on performance analysis in order to find these bottlenecks. Also, the influence of the hardware components on the performance is modeled to estimate the maximum achievable performance of a parallel file system. The paper focuses on the parallel virtual file system 2 (PVFS2) and shows results for the functionality file creation, small contiguous I/O requests and large contiguous I/O requests

关键词： File systems Performance analysis Network servers File servers Runtime Software performance Benchmark testing Libraries Software testing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR

作者： Mugurel Ionuţ Andreica Nicolae Ţăpuş Johan Pouwelse Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

LEDBAT is a new congestion control algorithm which was proposed in an IETF draft in March 2009. LEDBAT's goal is to provide a less-than-best-effort data transport service, i.e. a LEDBAT flow should back-off in the presence of other competing flows (TCP flows in particular). Because of its intended friendliness to competing flows, LEDBAT has already been implemented in the popular Bittorrent client uTorrent. In this paper we present performance evaluation results for our Python implementation of LEDBAT. We ran tests both in emulated networks as well as in real world networks. One of the tests involved approximately 300 volunteers spread throughout the world.

关键词： Peer to peer computing Testing Control systems Delay estimation Delay effects Streaming media Computer science Radio access networks Performance evaluation Time measurement

来源：评论

学校读者我要写书评

暂无评论

Grid resource management: On-demand provisioning, advance reservation, and capacity planning of grid resources

引用

作者： Siddiqui, Mumtaz Fahringer, Thomas Institute for Computer Science University of Innsbruck Technikerstraße 21a 6020 Innsbruck Austria Distributed and Parallel Systems Group Institute of Computer Science University of Innsbruck Technikerstraße 21a 6020 Innsbruck Austria

来源：评论

学校读者我要写书评

暂无评论

Adapting Particle Filter Algorithms to Many-Core Architectures

Adapting Particle Filter Algorithms to Many-Core Architectur...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： Mehdi Chitchian Alexander S. van Amesfoort Andrea Simonetto Tamás Keviczky Henk J. Sips Parallel and Distributed Systems Group Delft University of Technology Delft Netherlands Delft Center for Systems and Control Delft University of Technology Delft Netherlands

ISBN: (纸本)9781467360661

The particle filter is a Bayesian estimation technique based on Monte Carlo simulation. It is ideal for non-linear, nonGaussian dynamical systems with applications in many areas, such as computer vision, robotics, and econometrics. Practical use has so far been limited, because of steep computational requirements. In this study, we investigate how to design a particle filter framework for complex estimation problems using many-core architectures. We develop a robotic arm application as a highly flexible estimation problem to push estimation rates and accuracy to new levels. By varying filtering and model parameters, we evaluate our particle filter extensively and derive rules of thumb for good configurations. Using our robotic arm application, we achieve a few hundred state estimations per second with one million particles. With our framework, we make a significant step towards a wider adoption of particle filters and enable studies into filtering setups for even larger estimation problems.

关键词： Estimation Accuracy Graphics processing units Atmospheric measurements Particle measurements Hardware Particle filters

来源：评论

学校读者我要写书评

暂无评论

An energy-aware resource provisioning scheme for real-time applications in a cloud data center

An energy-aware resource provisioning scheme for real-time a...

引用

作者： Faragardi, Hamid Reza Dehnavi, Saeid Nolte, Thomas Kargahi, Mehdi Fahringer, Thomas School of Innovation Design and Engineering Mälardalen University Västerås Sweden Distributed and Parallel Systems Group Institute of Computer Science Innsbruck University Innsbruck Austria School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Tehran Iran

Based on a pay-as-you-go model, cloud computing provides the possibility of hosting pervasive applications from both academic and business domains. However, data centers hosting cloud applications consume huge amounts of electrical energy, contributing to high operational costs and large carbon footprints to the environment. Energy-aware resource provisioning is an effective solution to diminish the energy consumption of cloud data centers. Recently, a growing trend has emerged, where cloud technology is used to run periodic real-time applications such as multimedia, telecommunication, video gaming, and industrial applications. In order for a real-time application to be able to use cloud services, cloud providers have to be able to provide timing guarantees. In this paper, we introduce an energy-aware resource provisioning mechanism for cloud data centers, which are capable of serving real-time periodic tasks following the Software as a Service model. The proposed method is compared against an energy-aware version of the RT-OpenStack. RT-OpenStack is a recently proposed approach to provide a time-predictable version of OpenStack. The experimental results manifest that our proposed resource provisioning method outperforms energy-aware version of the RT-OpenStack by 16.01%, 25.45%, and 25.45% in terms of energy consumption, number of used servers, and average utilization of used servers, respectively. Moreover, from the scalability perspective, the preference of the proposed method for large-scale data centers is more considerable. Copyright © 2018 John Wiley & Sons, Ltd.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Characterizing the Dilemma of Performance and Index Size in Billion-Scale Vector Search and Breaking It with Second-Tier Memory

arXiv

引用

arXiv 2024年

作者： Cheng, Rongxin Peng, Yifan Wei, Xingda Xie, Hongrui Chen, Rong Shen, Sijie Chen, Haibo Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University China Shanghai AI Laboratory China Alibaba Group China

Vector searches on large-scale datasets are critical to modern online services like web search and RAG, which necessity storing the datasets and their index on the secondary storage like SSD. In this paper, we are the first to characterize the trade-off of performance and index size in existing SSD-based graph and cluster indexes: to improve throughput by 5.7 × and 1.7 ×, these indexes have to pay a 5.8 × storage amplification and 7.7 × with respect to the dataset size, respectively. The root cause is that the coarse-grained access of SSD mismatches the fine-grained random read required by vector indexes with small amplification. This paper argues that second-tier memory, such as remote DRAM/NVM connected via RDMA or CXL, is a powerful storage for addressing the problem from a system’s perspective, thanks to its fine-grained access granularity. However, putting existing indexes—primarily designed for SSD—directly on second-tier memory cannot fully utilize its power. Meanwhile, second-tier memory still behaves more like storage, so using it as DRAM is also inefficient. To this end, we build a graph and cluster index that centers around the performance features of second-tier memory. With careful execution engine and index layout designs, we show that vector indexes can achieve optimal performance with orders of magnitude smaller index amplification, on a variety of second-tier memory devices. Based on our improved graph and vector indexes on second-tier memory, we further conduct a systematic study between them to facilitate developers choosing the right index for their workloads. Interestingly, the findings on the second-tier memory contradict the ones on SSDs. © 2024, CC BY.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Music2Share - Copyright-compliant music sharing in P2P systems

Music2Share - Copyright-compliant music sharing in P2P syste...

引用

作者： Kalker, Ton Epema, Dick H. J. Hartel, Pieter H. Lagendijk, R.L. Van Steen, Maarten Philips Research Eindhoven Eindhoven 5656 AA Netherlands Technical University Eindhoven Eindhoven 5612 AZ Netherlands Parallel and Distributed Systems Group Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft 2600 GA Netherlands Distributed and Embedded Systems Group Department of Computer Science University of Twente Enschede 7500 AE Netherlands Delft University of Technology Delft 2628 CD Netherlands Department of Computer Science Vrije Universiteit Amsterdam 1081 HV Netherlands

Peer-to-peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions of identification, tracking, and sharing of music with those of licensing, monitoring, and payment. This highly decentralized music-aware P2P protocol will allow access to large amounts of music of guaranteed quality;it merges in a natural way the policing functions for copyright protection·and an efficient music-management infrastructure for the benefit of the user. © 2004 IEEE.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：