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

international symposium on parallel and distributed processing (IPDPS)

作者： H. Carr R.R. Kessler M. Swanson Department of Computer Science University of Utah Salt Lake UT USA

distributed C++ (DC++) is a language for writing parallel applications on loosely coupled distributed systems in C++. Its key idea is to extend the C++ class into 3 categories: gateway classes which act as communication and synchronization entry points between abstract processors, classes whose instances may be passed by value between abstract processors via gateways, and vanilla C++ classes. DC++ code is compiled to C++ code with calls to the DC++ runtime system. the DC++ compiler wraps gateway classes with handle classes so that remote procedure calls are transparent. It adds static variables to value classes and produces code which is used to marshal and unmarshal arguments when these value classes are used in remote procedure calls. Value classes are deep copied and preserve structure sharing. this paper shows DC++ compilation and performance.< >

关键词： Yarn Monitoring Programming profession Computer science Cities and towns Application software LAN interconnection Workstations Local area networks Multitasking

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable context-free grammar based data processing hardware with error recovery 06

Reconfigurable context-free grammar based data processing ha...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： J. Moscola Y.H. Cho J.W. Lockwood Department of Computer Science and Engineering Washington University of Saint Louis Saint Louis MO USA

ISBN: (纸本)9781424400546

this paper presents an architecture for context-free grammar (CFG) based data processing hardware for re-configurable devices. Our system leverages on CFGs to tokenize and parse data streams into a sequence of words with corresponding semantics. Such a tokenizing and parsing engine is sufficient for processing grammatically correct input data. However, most pattern recognition applications must consider data sets that do not always conform to the predefined grammar. therefore, we augment our system to detect and recover from grammatical errors while extracting useful information. Unlike the table look up method used in traditional CFG parsers, we map the structure of the grammar rules directly onto the field programmable gate array (FPGA). Since every part of the grammar is mapped onto independent logic, the resulting design is an efficient parallel data processing engine. To evaluate our design, we implement several XML parsers in an FPGA. Our XML parsers are able to process the full content of the packets up to 3.59 Gbps on Xilinx Virtex 4 devices

关键词： Data processing Hardware Field programmable gate arrays Engines XML Pattern recognition Data mining Programmable logic arrays Logic devices Logic design

来源：评论

学校读者我要写书评

暂无评论

Scibox: Online Sharing of Scientific Data via the Cloud

Scibox: Online Sharing of Scientific Data via the Cloud

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Jian Huang Xuechen Zhang Greg Eisenhauer Karsten Schwan Matthew Wolf Stephane Ethier Scott Klasky Georgia Institute of Technology Princeton Plasma Physics Laboratory Oak Ridge National Laboratory

Collaborative science demands global sharing of scientific data. But it cannot leverage universally accessible cloud-based infrastructures like Drop Box, as those offer limited interfaces and inadequate levels of access bandwidth. We present the Scibox cloud facility for online sharing scientific data. It uses standard cloud storage solutions, but offers a usage model in which high end codes can write/read data to/from the cloud via the APIs they already use for their I/O actions. With Scibox, data upload/download volumes are controlled via Data Reduction-functions stated by end users and applied at the data source, before data is moved, with further gains in efficiency obtained by combining DR-functions to move exactly what is needed by current data consumers. We evaluate Scibox with science applications and their representative data analytics - the GTS fusion and the combustion image processing - demonstrating the potential for ubiquitous data access with substantial reductions in network traffic.

关键词： Cloud computing Data models distributed databases Instruments Analytical models Bandwidth Standards

来源：评论

学校读者我要写书评

暂无评论

An overview of the ECO project 06

An overview of the ECO project

引用

international symposium on parallel and distributed processing (IPDPS)

作者： J. Chame Chun Chen P. Diniz M. Hall Yoon-Ju Lee R.F. Lucas Information Sciences Institute University of Southern California Marina del Rey CA USA

ISBN: (纸本)9781424400546

In this paper, we describe a compilation system that automates much of the process of performance tuning that is currently done manually by application programmers interested in high performance. Our approach combines compiler models and heuristics with guided empirical search to take advantage of their complementary strengths. the models and heuristics limit the search to a small number of candidate implementations, and the empirical results provide the most accurate information to the compiler to select among candidates and tune optimization parameter values. the overall approach can be employed to alleviate some of the performance problems that lead to inefficiencies in key applications today: register pressure, cache conflict misses, and the trade-off between synchronization, parallelism and locality in SMPs. the main focus of the paper is an algorithm for simultaneously optimizing across multiple levels of the memory hierarchy for dense-matrix computations. We have developed an initial compiler implementation, and present automatically-generated results on matrix multiply. Results on two architectures, SGI R10000 and Sun UltraSparc IIe, outperform the native compiler, and either outperform or achieve comparable performance as the ATLAS self-tuning library and the hand-tuned vendor BLAS library. this paper describes other components of the ECO system, including supporting tools and experiments with programmer-guided performance tuning. this approach has provided a foundation for a general framework for systematic optimization of domain-specific applications. Specifically, we are developing an optimization system for signal and image processing that exploits signal properties, and we are using machine learning and a knowledge-rich representation can be exploited to optimize molecular dynamics simulation

关键词： Tuning Libraries Signal processing Programming profession Optimizing compilers Registers parallel processing Focusing Computer architecture Sun

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimal Execution of Boolean Query Trees with Shared Streams

Cost-Optimal Execution of Boolean Query Trees with Shared St...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Henri Casanova Lipyeow Lim Yves Robert Frédéric Vivien Dounia Zaidouni University of Hawai'i at Manoa Honolulu USA Ecole Normale Supérieure de Lyon & INRIA France

the processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors, which incurs a cost, e.g., an energy expense that depletes the battery of a mobile query processing device. the objective is to determine the order in which predicates should be evaluated so as to shortcut part of the query evaluation and minimize the expected cost. this problem has been studied assuming that each data stream occurs at a single predicate. In this work we remove this assumption since it does not necessarily hold in practice. Our main results are an optimal algorithm for single-level trees and a proof of NP-completeness for DNF trees. For DNF trees, however, we show that there is an optimal predicate evaluation order that corresponds to a depth-first traversal. this result provides inspiration for a class of heuristics. We show that one of these heuristics largely outperforms other sensible heuristics, including a heuristic proposed in previous work.

关键词： Schedules Query processing Optimized production technology Complexity theory Batteries Smart phones Accelerometers

来源：评论

学校读者我要写书评

暂无评论

Dynamic QoS-aware coalition formation

Dynamic QoS-aware coalition formation

引用

international symposium on parallel and distributed processing (IPDPS)

作者： L. Nogueira L.M. Pinho IPP Hurray Research Group Polythecnic Institute of Porto Portugal

Users of wireless devices increasingly demand access to multimedia content with specific quality of service requirements. However, different users might tolerate different levels of service, or could be satisfied with different quality combinations choices. We provide semantically rich QoS specification interface for multidimensional QoS provisioning, allowing the user, and applications, to define fine-grained service requests. Traditionally, multimedia processing introduces heavy resource requirements on the client side. Our work tries to address this growing demand on resources and performance requirements, by allowing wireless nodes to cooperate with each other, or with wired neighbor nodes, to meet resource allocation requests and handle stringent constraints, opportunistically taking advantage of local network resources and processing power, as nodes move in range of each other, forming a temporary coalition for service execution. We argue that coalition formation is necessary when a single node cannot execute a specific service, and it may also be beneficial when groups perform more efficiently when compared to a single's node performance.

关键词： Quality of service Resource management Application software Computer networks Handheld computers Central processing Unit Multidimensional systems Real time systems Ad hoc networks Portable computers

来源：评论

学校读者我要写书评

暂无评论

SPHINX: a fault-tolerant system for scheduling in dynamic grid environments

SPHINX: a fault-tolerant system for scheduling in dynamic gr...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： J. In P. Avery R. Cavanaugh L. Chitnis M. Kulkarni S. Ranka University of Florida USA

A grid consists of high-end computational, storage, and network resources that, while known a priori, are dynamic with respect to activity and availability. Efficient scheduling of requests to use grid resources must adapt to this dynamic environment while meeting administrative policies. In this paper, we describe a framework called SPHINX that can administrate grid policies, and schedule complex and data intensive scientific applications. We present experimental results for several scheduling strategies that effectively utilize the monitoring and job-tracking information provided by SPHINX. these results demonstrate that SPHINX can effectively schedule work across a large number of distributed clusters that are owned by multiple units in a virtual organization in a fault-tolerant way in spite of the highly dynamic nature of the grid and complex policy issues. the novelty lies in use of effective monitoring of resources and job execution tracking in making scheduling decisions and fault-tolerance - something that is missed in today's grid environments.

关键词： Fault tolerant systems Dynamic scheduling Grid computing Processor scheduling Application software distributed computing Availability Fault tolerance Resource management Collaborative software

来源：评论

学校读者我要写书评

暂无评论

DPDNS introduction

Proceedings - IEEE 27th International Parallel and Distribut...

引用

Proceedings - ieee 27th international parallel and distributed processing symposium Workshops and PhD Forum, IPDPSW 2013 2013年 1457-1457页

作者： Avresky, Dimiter Maehle, Erik Distefano, Salvatore International Research Institute on Autonomic Network Computing IRIANC Boston United States University of Luebeck Germany Politecnico di Milan Italy Politecnico di Milano Italy

来源：评论

学校读者我要写书评

暂无评论

Automatic task scheduling/loop unrolling using dedicated RTR controllers in coarse grain reconfigurable architectures

Automatic task scheduling/loop unrolling using dedicated RTR...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： P. Benoit L. Torres G. Sassatelli M. Robert G. Cambon L.I.R.M.M Montpellier France

When designing a SoC, matching the required performance both in terms of processing power and power consumption tends to become more and more challenging. Moreover, since the range of targeted applications for every single product is growing rapidly, employing reconfigurable accelerators makes more and more sense to this purpose. Coarse grain reconfigurable architectures bring an alternative providing interesting performance/flexibility trade-offs over traditional approaches. this paper presents an original method allowing to efficiently exploit dynamical parallelism at both loop-level and task-level, which remains rarely used. this method called DHM (dynamic hardware multiplexing) is based upon the use of a hardwired controller dedicated to run-time task scheduling and automatic loop unrolling. this paper shows that significant performance improvements can be achieved through combining both intra and inter-task parallelism. Principles and validations are exposed through a case study on a coarse grain reconfigurable architecture.

关键词： Automatic control Reconfigurable architectures parallel processing Hardware Runtime Energy consumption Signal processing Image processing Field programmable gate arrays Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Task reweighting on multiprocessors: efficiency versus accuracy

Task reweighting on multiprocessors: efficiency versus accur...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： A. Block J.H. Anderson Department of Computer Science University of North Carolina Chapel Hill USA

We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task's processor share is specified using a weight. the responsiveness of a reweighting scheme can be assessed by comparing its allocations to those of an ideal scheduler that instantly reweights task. A reweighting scheme is fine-grained if the per-task "error" (in comparison to an ideal allocation) caused by a reweighting event is constant, and coarse-grained, otherwise. When the number of tasks N is larger than the number of processors M, the worst-case time complexity for fine-grained reweighting, /spl Omega/(NlogN), is larger than that of coarse-grained reweighting, /spl theta/(MlogN). In this paper, we construct two new reweighting algorithms that are hybrids of fine- and coarse-grained reweighting that have time complexity less than /spl theta/(NlogN), and produce less error than current coarse-grained techniques. We also present experiments to compare relative advantages of all schemes.

关键词： Application software Multiprocessing systems Processor scheduling Microphones Delay Real time systems Scheduling algorithm Computer science Computer applications Virtual environment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：