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

Bayesian Estimation of Component Reliability in Coherent systems

IEEE ACCESS 2018年 6卷 18520-18535页

作者： Rodrigues, Agatha S. Bhering, Felipe Pereira, Carlos A. De B. Polpo, Adriano Univ Sao Paulo Inst Math & Stat BR-05508090 Sao Paulo Brazil Univ Fed Sao Carlos BR-13565905 Sao Carlos SP Brazil

The first step in statistical reliability studies of coherent systems is the estimation of the reliability of each system component. For the cases of parallel and series systems, the literature is abundant, but it seems that the present paper is the first to present the general case of component inferences in coherent systems. The failure time model considered here is the three-parameter Weibull distribution. Furthermore, identically distributed failure times are not a required restriction. An important result is proved: without the assumption that components' lifetimes are mutually independent, a given set of sub-reliability functions does not identify the corresponding marginal reliability function. The proposed model is general in the sense that it can be used for components of any coherent system, from the simplest to the most complex designs. It can be considered for all kinds of censored data, including interval-censored data. An important property obtained for the Weibull model is that the posterior distributions are proper, even for non-informative priors. Using several simulations, the excellent performance of the model is illustrated. As real examples, boys' first use of marijuana and a device from a field-tracking data set are considered to show the efficiency of the solution even when censored data occurs.

关键词： Bayesian paradigm bridge system coherent system component lifetime parallel system parametric estimation series system Weibull model 2-out-of-3 system

来源：评论

学校读者我要写书评

暂无评论

RLLL: Accurate Relative Localization of RFID Tags with Low Latency

RLLL: Accurate Relative Localization of RFID Tags with Low L...

引用

International workshop on Quality of Service

作者： Xuan Liu Quan Yang Shigeng Zhang Bin Xiao The Science and Technology on Parallel and Distributed Processing Laboratory (PDL) P. R. China College of Computer Science and Electronic Engineering Hunan University P. R. China School of Computer Science and Engineering Central South University P. R. China The Hong Kong Polytechnic University Hong Kong

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

Radio frequency identification (RFID) has been widely used in many smart applications. In many scenarios, it is essential to know the ordering of a set of RFID tags. For example, to quickly detect misplaced books in smart libraries, we need to know the relative ordering of the tags attached to the books. Although several relative RFID localization algorithms have been proposed, they usually suffer from large localization latency and cannot support applications that require real-time detection of tag (product) positions like automatic manufacturing on an assembly line. Moreover, existing approaches face significant degradation in ordering accuracy when the tags are close to each other. In this paper, we propose RLLL, an accurate Relative Localization algorithm for RFID tags with Low Latency. RLLL reduces localization latency by proposing a novel geometry-based approach to identifying the V-zone in the phase reading sequence of each tag. Moreover, RLLL uses only the data in the V-zone to calculate relative positions of tags and thus avoids the negative effects of low-quality data collected when the tag is far from the antenna. Experimental results with commercial RFID devices show that RLLL achieves an ordering accuracy of higher than 0.986 with latency less than 0.8 seconds even when the tags are spaced only 7 mm from adjacent tags, in which case the state-of-the-art solutions only achieve ordering accuracy of lower than 0.8 with localization latency larger than 3 seconds.

关键词： RFID tags Manufacturing Antenna arrays Quality of service Libraries

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm to calculate max-min fair rates without per-flow state

A distributed algorithm to calculate max-min fair rates with...

引用

Proceedings of the ACM on Measurement and Analysis of Computing systems

作者： Jose, Lavanya Ibanez, Stephen Alizadeh, Mohammad McKeown, Nick Stanford University 353 Serra Mall Room 314 StanfordCA94305 United States MIT CSAIL 32 Vassar Street 32-G920 CambridgeMA02139 United States

Most congestion control algorithms, like TCP, rely on a reactive control system that detects congestion, then marches carefully towards a desired operating point (e.g. by modifying the window size or adjusting a rate). In an effort to balance stability and convergence speed, they often take hundreds of RTTs to converge; an increasing problem as networks get faster, with less time to react. This paper is about an alternative class of congestion control algorithms based on proactive-scheduling: switches and NICs "pro-actively" exchange control messages to run a distributed algorithm to pick "explicit rates" for each flow. We call these Proactive Explicit Rate Control (PERC) algorithms. They take as input the routing matrix and link speeds, but not a congestion signal. By exploiting information such as the number of flows at a link, they can converge an order of magnitude faster than reactive algorithms. Our main contributions are (1) s-PERC ("stateless" PERC), a new practical distributed PERC algorithm without per-flow state at the switches, and (2) a proof that s-PERC computes exact max-min fair rates in a known bounded time, the first such algorithm to do so without per-flow state. To analyze s-PERC, we introduce a parallel variant of standard waterfilling, 2-Waterfilling. We prove that s-PERC converges to max-min fair in 6N rounds, where N is the number of iterations 2-Waterfilling takes for the same routing matrix. We describe how to make s-PERC practical and robust to deploy in real networks. We confirm using realistic simulations and an FPGA hardware testbed that s-PERC converges 10-100x faster than reactive algorithms like TCP, DCTCP and RCP in data-center networks and 1.3–6x faster in wide-area networks (WANs). Long flows complete in close to the ideal time, while short-lived flows are prioritized, making it appropriate for data-centers and WANs. © 2019 Association for Computing Machinery.

关键词： Wide area networks Congestion control (communication) Matrix algebra MESH networking time switches Transmission control protocol Control messages Data center networks Max min fairness Number of iterations Proactive scheduling Reactive algorithms realistic simulation Stability and convergence

来源：评论

学校读者我要写书评

暂无评论

Dynamic energy-aware scheduling for parallel task-based application in cloud computing

引用

FUTURE GENERATION COMPUTER systems-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 78卷 257-271页

作者： Juarez, Fredy Ejarque, Jorge Badia, Rosa M. BSC Workflows & Distributed Comp Grp Barcelona 08034 Spain Inst Tecnol Super Alamo Temapache Xoyotitla 92730 Veracruz Mexico CSIC Artificial Intelligence Res Inst IIIA Madrid Spain

Green Computing is a recent trend in computer science, which tries to reduce the energy consumption and carbon footprint produced by computers on distributed platforms Such as clusters, grids, and clouds. Traditional scheduling solutions attempt to minimize processing times without taking into account the energetic cost. One of the methods for reducing energy consumption is providing scheduling policies in order to allocate tasks on specific resources that impact over the processing times and energy consumption. In this paper, we propose a real-time dynamic scheduling system to execute efficiently task based applications on distributed computing platforms in order to minimize the energy consumption. Scheduling tasks on multiprocessors is a well known NP-hard problem and optimal solution of these problems is not feasible, we present a polynomial-time algorithm that combines a set of heuristic rules and a resource allocation technique in order to get good solutions on an affordable time scale. The proposed algorithm minimizes a multi-objective function which combines the energy-consumption and execution time according to the energy-performance importance factor provided by the resource provider or user, also taking into account sequence-dependent setup times between tasks, setup times and down times for virtual machines (VM) and energy profiles for different architectures. A prototype implementation of the scheduler has been tested with different kinds of DAG generated at random as well as on real task-based COMPSs applications. We have tested the system with different size instances and importance factors, and we have evaluated which combination provides a better solution and energy savings. Moreover, we have also evaluated the introduced overhead by measuring the time for getting the scheduling solutions for a different number of tasks, kinds of DAG, and resources, concluding that our method is suitable for run-time scheduling. (C) 2016 Elsevier B.V. All rights rese

关键词： distributed computing Cloud computing Green computing Task-based applications Energy-aware scheduling Multi-heuristic resource allocation

来源：评论

学校读者我要写书评

暂无评论

Coded matrix multiplication on a group-based model

arXiv

引用

arXiv 2019年

作者： Kim, Muah Sohn, Jy-yong Moon, Jaekyun School of Electrical Engineering KAIST Daejeon Korea Republic of

Coded distributed computing has been considered as a promising technique which makes large-scale systems robust to the "straggler" workers. Yet, practical system models for distributed computing have not been available that reflect the clustered or grouped structure of real-world computing servers. Neither the large variations in the computing power and bandwidth capabilities across different servers have been properly modeled. We suggest a group-based model to reflect practical conditions and develop an appropriate coding scheme for this model. The suggested code, called group code, employs parallel encoding for each group. We show that the suggested coding scheme can asymptotically achieve optimal computing time in regimes of infinite n, the number of workers. While theoretical analysis is conducted in the asymptotic regime, numerical results also show that the suggested scheme achieves near-optimal computing time for any finite but reasonably large n. Moreover, we demonstrate that the decoding complexity of the suggested scheme is significantly reduced by the virtue of parallel decoding. Copyright © 2019, The Authors. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Resources Co-Allocation Optimization Algorithms for distributed Computing Environments 18

Resources Co-Allocation Optimization Algorithms for Distribu...

引用

47th International Conference on parallel Processing (ICPP) / International workshop on Embedded Multicore systems (EMS)

作者： Toporkov, Victor Yemelyanov, Dmitry Natl Res Univ Moscow Power Engn Inst Moscow Russia

ISBN: (纸本)9781450365239

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources (clusters, CPU nodes equipped with multicore processors, networks etc.). A single slot is a time span that can be assigned to a task, which is a part of a parallel job. The job launch requires a co-allocation of a specified number of slots starting and finishing synchronously. The challenge is that slots associated with different heterogeneous resources of distributed computing environments may have arbitrary start and finish points, different performance, latency, pricing policies. Some existing algorithms assign a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. In this paper, algorithms for efficient slot selection are studied and compared with known approaches. The novelty of the proposed approach is in a general algorithm selecting a set of slots efficiently according to the specified criterion.

关键词： Scheduling distributed Computing Resources Co-allocation Optimization Slot Job Window

来源：评论

学校读者我要写书评

暂无评论

real-time signal processing for sub-THz range grating-based distributed fiber sensing

Real-time signal processing for sub-THz range grating-based ...

引用

Conference on Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace systems

作者： Yao, Zheyi Hefferman, Gerald Ren, Kan Wei, Tao Univ Rhode Isl Dept Elect Comp & Biomed Engn Kingston RI 02881 USA Brown Univ Warren Alpert Med Sch Providence RI 02912 USA Nanjing Univ Sci & Technol Nanjing 210094 Jiangsu Peoples R China

ISBN: (数字)9781510616936

ISBN: (纸本)9781510616936

distributed optical fiber sensors are an increasingly utilized method of gathering distributed strain and temperature data. However, the large amount of data they generate present a challenge that limits their use in real-time, in-situ applications. This letter describes a parallel and pipelined computing architecture that accelerates the signal-processing speed of sub-terahertz fiber sensor (sub-THz-fs) arrays, maintaining high spatial resolution while allowing for expanded use for real-time sensing and control applications. The computing architecture described was successfully implemented in a field programmable gate array (FPGA) chip. The signal processing for the entire array takes only 12 system clock cycles. In addition, this design removes the necessity of storing any raw or intermediate data.

关键词： Fiber sensor

来源：评论

学校读者我要写书评

暂无评论

Automated Analysis of Task-parallel Execution Behavior via Artificial Neural Networks 32

Automated Analysis of Task-Parallel Execution Behavior via A...

引用

27th International Heterogeneity in Computing workshop in conjunction with 32nd IEEE International parallel and distributed Processing Symposium (IPDPS)

作者： Neill, Richard Drebes, Andi Pop, Antoniu Univ Manchester Sch Comp Sci Manchester Lancs England

ISBN: (纸本)9781538655559

We present an automated analysis technique that leverages artificial neural networks to identify possible causes for sub-optimal execution of task-parallel programs. Performance anomalies in task-parallel programs are often extremely difficult to analyze due to the complexity of the interactions between dynamic runtime systems and hardware. While Hardware Performance Monitoring is a common technique to capture hardware behavior, understanding how the resulting hardware event profiling data relates to task performance is often non-trivial and time-consuming. In this work, we present an automated technique for task-parallel performance analysis that identifies the hardware behaviors that have the greatest impact on task performance. Our technique uses artificial neural networks to model these relationships, allowing for isolation of the specific hardware events that have the most impact to slow down task execution. We show that our technique provides new insights into task-parallel execution behavior, allowing for acceleration of the performance optimization process.

关键词： Task analysis Hardware Monitoring Neural networks Neurons Predictive models Machine learning"

来源：评论

学校读者我要写书评

暂无评论

Exploring Practical Limitations of Joint Routing and Scheduling for TSN with ILP 24

Exploring Practical Limitations of Joint Routing and Schedul...

引用

24th IEEE International Conference on Embedded and real-time Computing systems and Applications (RTCSA)

作者： Falk, Jonathan Duerr, Frank Rothermel, Kurt Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany

ISBN: (纸本)9781538677599

IEEE 802.1Q networks with extensions for time-sensitive networking aim to enable converged networks. Converged networks support hard-real time communication services in addition to the currently supported services classes. real-time communication in these networks requires routes and schedules for the real-time transmissions. We present a formulation in the integer linear programming (ILP) framework which models the joint routing and scheduling problem for flows of periodic real-time transmissions in converged TSN networks. In the joint routing and scheduling problem, both routes and schedules for real-time transmissions are computed in one step, i.e. we do not schedule over predefined routes. We explore the practical limitations of this approach by evaluating the runtime of problem instances with widely varying parameters with a state-of-the-art ILP solver. The observed solver runtimes indicate the qualitative impact of the number of real-time flows, the size of the network, the transmission frequency of real-time transmissions, and the network topology.

关键词： real-time systems Schedules Switches Routing Delays Logic gates Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Modeling and Simulation of an Operational Transformation Algorithm using Finite State Machines 12

Modeling and Simulation of an Operational Transformation Alg...

引用

12th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)

作者： Gadea, Cristian Ionescu, Bogdan Ionescu, Dan Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

ISBN: (纸本)9781538646403

Although the principles of real-time collaborative editing have been explored since the eighties, team collaboration software facilitating the completion of tasks as a group continues to be a very hot research topic. A series of theoretical and practical results obtained by the research and industrial communities originated in the theory of distributed computing. They were devised for managing the concurrent nature of user actions and for maintaining the consistency of data as changes are introduced randomly, by multiple users and in real-time. As such, centralized collaborative editing servers were designed to allow users to work in parallel on a document from a typical web browser. In order to maintain the consistency of the content being modified at different sites in different orders, Operational Transformation (OT) mechanisms are at the core of collaboration servers enabling web-based co-editing. However, as expected of modern web application deployments, a centralized OT algorithm is required that must also exhibit properties such as scalability and reliability. In this paper, the processes involved in the client-server interactions of OT are modeled as real-time systems using Finite State Machine (FSM) theory. The consistency of the data is controlled by formal groups of FSMs. Hierarchical FSMs are used to define and simulate the real-time behavior of client and server components when processing and transforming changes initiated by users. The FSM-based OT implementation is tested using random inputs and the approach is shown to be helpful for organizing and managing the complex distributed aspects of such algorithms.

关键词： Collaborative Software Platforms distributed Computing systems Consistency and Concurrency Finite State Machines real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：