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

International Symposium on parallel Processing

作者： D.R. Chakrabarti P. Banerjee Center for Parallel and Distributed Computing ECE Department Tech.Institute Northwestern University Evanston IL USA

This paper explains how efficient support for semi-regular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work is in showing how, unlike other existing schemes, our scheme is able to minimize preprocessing overheads and maintain sophisticated communication optimizations (such as reduction of inter-processor communication during schedule generation and sharing of communicated information between regular and irregular accesses) even in the presence of semi-regular distributions. It is only natural that preprocessing overheads associated with semi-regular distributions be intermediate between those involved for regular and irregular distributions. This paper shows how various properties can be inferred for semi-regular distributions. These allow the use of the interval representation which in turn reduces the preprocessing overhead and makes possible compatible code generation for hybrid references. Experimental results on a 16-processor IBM SP-2 for a number of sparse applications using semi-regular distributions show that our scheme is feasible.

关键词： Sparse matrices Runtime Hybrid power systems Contracts Concurrent computing Costs Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Campaign scheduling

Campaign scheduling

引用

International Conference on High Performance computing

作者： Vinicius Pinheiro Krzysztof Rzadca Denis Trystram Laboratory for Parallel and Distributed Computing University of São Paulo Brazil Institute of Informatics University of Warsaw Poland Institut Universitaire de France France

We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns. Jobs belonging to a single campaign are sequential and independent, but any job from a campaign cannot start until all the jobs from the previous campaign are completed. Each user's goal is to minimize the sum of flow times of his campaigns. We define a theoretical model for Campaign scheduling and show that, in the general case, it is NP-hard. For the single-user case, we show that an ρ-approximation scheduling algorithm for the (classic) parallel job scheduling problem is also an ρ-approximation for the Campaign scheduling problem. For the general case with k users, we establish a fairness criterion inspired by time sharing. We propose FAIRCAMP, a scheduling algorithm which uses campaign deadlines to achieve fairness among users between consecutive campaigns. We prove that FAIRCAMP increases the flow time of each user by a factor of at most k ρ compared with a machine dedicated to the user. We also prove that FAIRCAMP is a ρ-approximation algorithm for the maximum stretch. By simulation, we compare FAIRCAMP to the First-Come-First-Served (FCFS). We show that, compared with FCFS, FAIRCAMP reduces the maximum stretch by up to 3.4 times. The difference is significant in systems used by many (k > 5) users. Our results show that, rather than just individual, independent jobs, campaigns of jobs can be handled by the scheduler efficiently and fairly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An automated and power-aware framework for utilization of IP cores in hardware generated from C descriptions targeting FPGAs

An automated and power-aware framework for utilization of IP...

引用

Annual IEEE Symposium on Field-Programmable Custom computing Machines (FCCM)

作者： A. Jones P. Banerjee Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Technological Institute Northwestern University Evanston IL USA

Use of hand optimized Intellectual Property (IP) logic cores is prolific in hardware design. These IP cores range from rather complicated signal processing transforms and filters to arithmetic operators. While IP cores remain a standard way to utilize the improvement in FPGA technology and contend with time to market pressure through reuse, popularity of tools generating hardware descriptions from high-level languages is increasing in popularity. The PACT HDL behavioral synthesis tool attempts to combine these two methods within a power-aware framework. PACT HDL generates RTL HDL codes in VHDL and Verilog using a finite state machine (FSM) style. These codes use intrinsic operators to represent calculations such as addition, subtraction, and multiplication. The output HDL codes are passed to commercial RTL synthesis tools that generate the gate-level hardware descriptions. Each intrinsic operator is replaced with a hardware implementation of the calculation by the synthesis tool. Unfortunately, by leaving this decision to the synthesis tool, the gate-level instantiation may not be appropriate for the desired constraints, particularly those relating to power consumed. The synthesis tools tend to use combinational implementations that are area and power hungry. In some cases, the tool may not be able to instantiate the appropriate logic, such as the division operator, at all.

关键词： Power generation Field programmable gate arrays Hardware design languages Design optimization Intellectual property Logic design Signal processing Filters Arithmetic Time to market

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Data Access for Map Services based on R-star tree index and LSM tree

Spatiotemporal Data Access for Map Services based on R-star ...

引用

IEEE International Conference on Intelligent Engineering Systems (INES)

作者： Emil Gatial Zoltán Balogh Sepideh Hassankhani Dolatabadi Dpt. of Parallel and Distributed Computing Institute of Informatics Slovak Academy of Sciences Bratislava Slovkia Dpt. of Modelling and Control of Discrete Processes Institute of Informatics Slovak Academy of Sciences Bratislava Slovkia

ISBN: (数字)9798350367591

ISBN: (纸本)9798350367607

The paper proposed an approach to building a scalable service for spatiotemporal data storage to be used in applications that require searching for localized data and possibility of scaling up the storage resources. The motivation for proposing this approach was enabling the localized data being overlayed over the map, while transferring only required data and minimize the latency time. The paper describes the architecture combining the R-star tree index and Log Structured Merge (LSM) tree methods. The implementation framework based on Erlang OTP is proposed to provide a basis for sustainability and resiliency.

关键词： Buildings Memory Spatiotemporal phenomena Geospatial analysis Indexes Sustainable development Resilience

来源：评论

学校读者我要写书评

暂无评论

Auction-Based Job Scheduling for Smart Manufacturing 17

Auction-Based Job Scheduling for Smart Manufacturing

引用

17th IEEE International Symposium on Applied Computational Intelligence and informatics, SACI 2023

作者： Gatial, Emil Balogh, Zoltan Dolatabadi, Sepideh Hassankhani Ghorbel, Hatem Carrino, Stefano Dreyer, Jonathan Montequin, Vicente Rodriguez Gligor, Adrian Iantovics, Laszlo Barna Institute of Informatics Sav Parallel and Distributed Computing Bratislava Slovakia Institute of Informatics Sav Modelling and Control of Discrete Processes Bratislava Slovakia Haute École Arc Ingénierie HES-SO St-Imier Switzerland University of Oviedo Project Engineering Area Oviedo Spain University of Medicine Pharmacy Science and Technology of Targu Mures Electrical Engineering and Information Technology 'George Emil Palade' Targu Mures Romania

ISBN: (纸本)9798350321104

The paper describes a real-time job scheduling method designed for production of goods with different characteristics on machines with different processing parameters. The objective is to maximize the global reward of the factory as a sum of the rewards for each machine job. Traditionally, the task assignment problems deal with the assignment of m-tasks to n-agents and are calculated by analytical methods or heuristics. The proposed method is based on online auctions that distributes the tasks to the machines using the software agents. The method is implemented using the ERTS (Erlang Real-Time System) that allows adopting the features of fault-tolerance and real-time processing. The paper starts with introduction and review of related state-of-the-art. The following chapter briefly describes the problem and the specific requirements. The following chapter describes the software architecture of the online auction system, the use-case and the motivation for developing this method. The proposed method auction-based task assignment and its implementation are described in the next chapters. At the end of the work, the results of the method are presented in comparison with the optimal solution and the performance characteristics are also described. In the conclusion, possible advances and future work are proposed. © 2023 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Text processing by using projective ART neural networks

Text processing by using projective ART neural networks

引用

New Trends in Signal Processing (NTSP)

作者： Radoslav Forgáč Roman Krakovský Dept. of Parallel and Distributed Information Processing Institute of Informatics Slovak Academy of Sciences Bratislava Slovakia Department of Informatics Catholic University Ružomberok Slovakia

ISBN: (纸本)9781509021628

This paper presents the summary of experience obtained with the modified clustering algorithm of Projective Adaptive Resonance Theory. The algorithm was proposed by authors, and was tested for text processing. Possible usage of the algorithm is exemplified by text document clustering, and generation of keyword dictionaries from text documents.

关键词： Neurons Clustering algorithms Dictionaries Neural networks Semantics Text processing Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Detecting faults by tracing companion states in cloud computing systems

引用

Jisuanji Xuebao/Chinese Journal of Computers 2012年第5期35卷 856-870页

作者： Rao, Xiang Wang, Huai-Min Chen, Zhen-Bang Zhou, Yang-Fan Cai, Hua Zhou, Qi Sun, Ting-Tao National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China Department of Computing Platform Alibaba Cloud Computing Company Hangzhou 310011 China

A common way to construct a fault model is injecting the fault into the system and observing the subsequent symptoms, e. g. event logs. However, fault features would vary during the propagation period, and present different symptoms at different stage of the fault propagation process. The exiting detection window based feature extraction methods can only identify the early symptoms of a fault, but fail to detect the latter symptoms and cause false alarms. To solve the problem, we present a fault feature extraction method, called Companion State Tracer (CSTracer), which consists of 3 integrated steps: (1) pre-process logs to remove the unrelated logs;(2) construct a general identifier for the early symptoms of a fault;(3) construct a finite state machine model for the fault to trace the latter symptoms. CSTracer can persistently monitor a fault after the fault has been identified. We have justified the effectiveness of CSTracer in an enterprise cloud system. Compared with the existing, the results show that CSTracer has a better detection accuracy.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for computing disjoint QoS paths

Efficient algorithms for computing disjoint QoS paths

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： A. Orda A. Sprintson Department of Electrical Engineering Technion-Israel Institute of Technology Haifa Israel Parallel and Distributed Computing Group California Institute of Technology Pasadena CA USA

Networks are expected to meet a growing volume of requirements imposed by new applications such as multimedia streaming and video conferencing. Two essential requirements are support of quality of service (QoS) and resilience to failures. In order to satisfy these requirements, a common approach is to use two disjoint paths between the source and the destination nodes, the first serving as a primary path and the second as a restoration path. Such approach, referred to as path restoration, has several advantages, the major one being the ability to switch promptly from one path to another in the event of a failure. A major issue in this context is how to identify two paths that satisfy the QoS constraints imposed by network applications. Since network resources, e.g., bandwidth, are allocated along both primary and restoration paths, we need to consider also the overall network performance. Accordingly, in this paper we study the fundamental problem of finding two disjoint paths that satisfy the QoS constraints at minimum cost. We present approximation algorithms with provable performance guarantees for this fundamental network problem.

关键词： Quality of service Protection Switches Streaming media Costs Videoconference Telecommunication traffic Bandwidth Delay distributed computing

来源：评论

学校读者我要写书评

暂无评论

Grid computing in China

引用

Journal of Grid computing 2004年第2期2卷 193-206页

作者： Yang, Guangwen Jin, Hai Li, Minglu Xiao, Nong Li, Wei Wu, Zhaohui Wu, Yongwei Tang, Feilong Department of Computer Science and Technology Tsinghua University Beijing China School of Computer Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China College of Computer Science Zhejiang University Hangzhou 310027 China

Grid computing presents a new trend to distributed computation and Internet applications, which can construct a virtual single image of heterogeneous resources, provide uniform application interface and integrate widespread computational resources into super, ubiquitous and transparent aggregation. In the adoption of Grid computing, China, who is facing more resource heterogeneity and other specific demands, has put much effort on both research and practical utilization. In this paper, we introduce the major China Grid research projects and their perspective applications. First we give the overview of the four government-sponsored programs in Grid, namely the China National Grid, ChinaGrid, NSFC Grid, and ShanghaiGrid. Then we present six representative ongoing Grid systems in details, which are categorized into Grid middleware and Grid application. This paper provides the general picture of Grid computing in China, and shows the great efforts, devotion and confidence in China to use Grid technology to boost the society, economics and scientific research. © Springer 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Monitoring of Mobile Objects with Uncertainty-Aware Tolerances

Energy-Efficient Monitoring of Mobile Objects with Uncertain...

引用

International Symposium on Database Engineering and Applications (IDEAS)

作者： Tobias Farrell Reynold Cheng Kurt Rothermel Institute of Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany Department of Computing Hong Kong Polytechnic University Hong Kong China

In location-based services, continuous queries are often employed to monitor the locations of mobile objects that are determined by sensing devices like GPS receivers. Due to limited battery resources, it is important for these objects to acquire and report location data only if necessary. We study how these energy- consuming operations can be reduced with a controlled impact on query accuracy of continuous range queries (CRQs). Specifically, we develop uncertainty- aware tolerances, which are user-defined error bounds that provide correctness guarantees, with consideration of different sources of data uncertainty: sensing uncertainty, sampling uncertainty, and communication delay. Novel algorithms are developed to control carefully when an object should acquire and update a location, while satisfying these tolerances. Extensive simulations validate the effectiveness of our methods.

关键词： Energy efficiency Monitoring Uncertainty Global Positioning System Costs Energy consumption Frequency Batteries Communication system control Error correction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：