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

MICROPROCESSING AND MICROPROGRAMMING 1988年第1-5期24卷 491-500页

作者： ZEDAN, H UNIV YORK DEPT COMP SCIYORK YO1 5DDN YORKSHIREENGLAND

“Time-dependent” semantics are given for the programming language occam. Using such semantics, behavioural analysis of distributed real-time computations written in occam can be made. The weakest pre-condition, which reflects the ‘latest point’ in ‘time’ to start the computation such that a proper termination is guaranteed within a pre-specified time TG, may then be derived.

关键词： distributed computation Real-time wp-Calculus occam Deadline

来源：评论

学校读者我要写书评

暂无评论

distributed computational Framework for Large-Scale Stochastic Convex Optimization

引用

ENERGIES 2021年第1期14卷 23-23页

作者： Rostampour, Vahab Keviczky, Tamas Univ Groningen Engn & Technol Inst Groningen ENTEG Nijenborgh 4 NL-9747 AG Groningen Netherlands Delft Univ Technol Delft Ctr Syst & Control NL-2628 CD Delft Netherlands

This paper presents a distributed computational framework for stochastic convex optimization problems using the so-called scenario approach. Such a problem arises, for example, in a large-scale network of interconnected linear systems with local and common uncertainties. Due to the large number of required scenarios to approximate the stochasticity of these problems, the stochastic optimization involves formulating a large-scale scenario program, which is in general computationally demanding. We present two novel ideas in this paper to address this issue. We first develop a technique to decompose the large-scale scenario program into distributed scenario programs that exchange a certain number of scenarios with each other to compute local decisions using the alternating direction method of multipliers (ADMM). We show the exactness of the decomposition with a-priori probabilistic guarantees for the desired level of constraint fulfillment for both local and common uncertainty sources. As our second contribution, we develop a so-called soft communication scheme based on a set parametrization technique together with the notion of probabilistically reliable sets to reduce the required communication between the subproblems. We show how to incorporate the probabilistic reliability notion into existing results and provide new guarantees for the desired level of constraint violations. Two different simulation studies of two types of interconnected network, namely dynamically coupled and coupling constraints, are presented to illustrate advantages of the proposed distributed framework.

关键词： stochastic optimization scenario convex program distributed computation distributed stochastic systems distributed scenario program decentralized scenario program plug-and-play framework

来源：评论

学校读者我要写书评

暂无评论

Capacity provision networks: Foundations of markets for sharable resources in distributed computational economies

引用

INFORMATION SYSTEMS RESEARCH 2008年第2期19卷 144-160页

作者： Du, Anna Ye Geng, Xianjun Gopal, Ram Ramesh, R. Whinston, Andrew B. SUNY Buffalo Dept Management Sci & Syst Buffalo NY 14260 USA Univ Washington Dept Informat Syst & Operat Management Seattle WA 98195 USA Univ Connecticut Dept Operat & Informat Management Storrs CT 06269 USA Univ Texas Austin Dept Management Sci & Informat Risk & Operat Mana Austin TX 78712 USA

With the rapid growth of rich-media content over the Internet, content and service providers (SP) are increasingly facing the problem of managing their service resources cost-effectively while ensuring a high quality of service (QoS) delivery at the same time. In this research we conceptualize and model an Internet-based storage provisioning network for rich-media content delivery. This is modeled as a capacity provision network (CPN) where participants possess service infrastructures and leverage their topographies to effectively serve specific customer segments. A CPN is a network of SPs coordinated through an allocation hub. We first develop the notion of discounted QoS capabilities of storage resources. We then investigate the stability of the discount factors over time and the network topography using a test-bed on the Internet through a longitudinal empirical study. Finally, we develop a market maker mechanism for optimal multilateral allocation and surplus sharing in a network. The proposed CPN is closely tied to two fundamental properties of Internet service technology: positive network externality among cooperating SPs and the property of effective multiplication of capacity allocation among several distributed service sites. We show that there exist significant incentives for SPs to engage in cooperative allocation and surplus sharing. We further demonstrate that intermediation can enhance the allocation effectiveness and that the opportunity to allocation and surplus sharing can play an important role in infrastructure planning. In conclusion, this study demonstrates the practical business viability of a cooperative CPN market.

关键词： capacity provision networks resource sharing online market distributed computation quality of service

来源：评论

学校读者我要写书评

暂无评论

TERMINATION DETECTION FOR distributed computationS

引用

INFORMATION PROCESSING LETTERS 1984年第1期18卷 33-36页

作者： TOPOR, RW Department of Computer Science University of Melbourne Parkville Victoria 3052 Australia

An important problem in distributed programming is identifying the termination of a distributed computation in which a main computation process signals other processes to become active. Once all processes have become idle, the computation is terminated. An effective detection procedure requires: 1. that processes be modified independently of their definitions, 2. that the procedure does not delay the main computation, and 3. that no new communication channels be established between processes. A termination detection algorithm for distributed computations is presented to satisfy these requirements. With the algorithm, signals are generated throughout the spanning tree, initially inward from leaves to root; then, if termination is not detected, signals are generated outward from root to leaves. This process is repeated until termination is detected.

关键词： distributed computation distributed programming concurrency CSP termination detection program derivation

来源：评论

学校读者我要写书评

暂无评论

DETECTING CAUSAL RELATIONSHIPS IN distributed computationS - IN SEARCH OF THE HOLY-GRAIL

引用

distributed COMPUTING 1994年第3期7卷 149-174页

作者： SCHWARZ, R MATTERN, F UNIV SAARLAND DEPT COMP SCI D-66041 SAARBRUCKEN GERMANY

The paper shows that characterizing the causal relationship between significant events is an important but non-trivial aspect for understanding the behavior of distributed programs. An introduction to the notion of causality and its relation to logical time is given;some fundamental results concerning the characterization of causality are presented. Recent work on the detection of causal relationships in distributed computations is surveyed. The issue of observing distributed computations in a causally consistent way and the basic problems of detecting global predicates are discussed. To illustrate the major difficulties, some typical monitoring and debugging approaches are assessed, and it is demonstrated how their feasibility is severely limited by the fundamental problem to master the complexity of causal relationships.

关键词： distributed computation Causality distributed system Causal ordering Logical time Vector time Global predicate detection distributed debugging Timestamps

来源：评论

学校读者我要写书评

暂无评论

Scalable data assimilation with message passing

引用

Environmental Data Science 2025年 4卷 e1-e1页

作者： Key, Oscar Takao, So Giles, Daniel Deisenroth, Marc Peter UCL Centre for Artificial Intelligence University College London London United Kingdom Department of Computing and Mathematical Sciences California Institute of Technology Pasadena CA United States The Alan Turing Institute London United Kingdom

Data assimilation is a core component of numerical weather prediction systems. The large quantity of data processed during assimilation requires the computation to be distributed across increasingly many compute nodes;yet, existing approaches suffer from synchronization overhead in this setting. In this article, we exploit the formulation of data assimilation as a Bayesian inference problem and apply a message-passing algorithm to solve the spatial inference problem. Since message passing is inherently based on local computations, this approach lends itself to parallel and distributed computation. In combination with a GPU-accelerated implementation, we can scale the algorithm to very large grid sizes while retaining good accuracy and compute and memory requirements. © The Author(s), 2025.

关键词： Bayesian inference data assimilation distributed computation message passing

来源：评论

学校读者我要写书评

暂无评论

Stochastic Control of the Scalable High Performance distributed computations

Stochastic Control of the Scalable High Performance Distribu...

引用

9th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Onderka, Zdzislaw Univ Sci & Technol AGH Dept Geoinformat & Appl Comp Sci Krakow Poland

ISBN: (纸本)9783642314995;9783642315008

The paper presents model desribing the dynamics of the background load for the computers in the network. For that model two problems of the task allocation in the network are formulated: the problem of the stochastic control based on the background load model and the stochastic control based on the Markov Decision Process Theory. The open-loop and closed-loop control algorithms based on the stochastic forecast and Markov Decision Process Theory respectively are presented.

关键词： stochastic control distributed computation optimal task distribution Markov Decision Process

来源：评论

学校读者我要写书评

暂无评论

Hardening functions for large scale distributed computations

Hardening functions for large scale distributed computations

引用

2003 IEEE Symposium on Security and Privacy

作者： Szajda, D Lawson, B Owen, J Univ Richmond Richmond VA 23173 USA

ISBN: (纸本)0769519407

The past few years have seen the development of distributed computing platforms designed to utilize the spare processor cycles of a large number of personal computers attached to the Internet in an effort to generate levels of computing power normally achieved only with expensive supercomputers. Such large scale distributed computations running in untrusted environments raise a number of security concerns, including the potential for intentional or unintentional corruption of computations, and for participants to claim credit for computing that has not been completed This paper presents two strategies for hardening selected applications that utilize such distributed computations. Specifically, we show that carefully seeding certain tasks with precomputed data can significantly increase resistance to cheating (claiming credit for work not computed) and incorrect results. Similar results are obtained for sequential tasks through a strategy of sharing the computation of N tasks among K > N nodes. In each case, the associated cost is significantly less than the cost of assigning tasks redundantly.

关键词： distributed computation probabilistic verification ringers

来源：评论

学校读者我要写书评

暂无评论

Toward an optimal redundancy strategy for distributed computations

Toward an optimal redundancy strategy for distributed comput...

引用

IEEE International Conference on Cluster Computing

作者： Szajda, Doug Lawson, Barry Owen, Jason Univ Richmond Richmond VA 23173 USA

ISBN: (纸本)9780780394858

Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly addressed by assigning tasks redundantly. Aside from the additional computational costs, a significant disadvantage of redundancy is its vulnerability to colluding adversaries. This paper presents a tunable redundancy-based task distribution strategy that increases resistance to collusion while significantly decreasing the associated computational costs. Specifically, our strategy guarantees a desired cheating detection probability regardless of the number of copies of a specific task controlled by the adversary. Though not the first distribution scheme with these properties, the proposed method improves upon existing strategies in that it requires fewer computational resources. More importantly, the strategy provides a practical lower bound for the number of redundantly assigned tasks required to achieve a given detection probability.

关键词： distributed computation probabilistic verification

来源：评论

学校读者我要写书评

暂无评论

Innovative Applications and Services Based on Privacy Enhanced distributed computations on IoT Devices 18

Innovative Applications and Services Based on Privacy Enhanc...

引用

18th IEEE International Conference on Business Informatics (CBI)

作者： Avgerou, Artemis D. Nastou, Panayotis E. Stamatiou, Yannis C. Imperial Coll Sch Business London SW7 2AZ England Univ Aegean Dept Math Samos 83200 Greece Univ Florida Ctr Appl Optimizat Gainesville FL USA Univ Patras Dept Business Adm Patras Greece Comp Technol Inst & Press Diophantus Patras 26504 Greece

ISBN: (纸本)9781509032310

computational Intelligence methods are widely used in a diverse range of scientific and industrial applications, including economic modeling, finance, networks and transportation, database design, design and control, scheduling and others. On the other hand, Collective Intelligence methods aim at harvesting the power of people's mobile devices for gathering and sending useful information about the values and the variations of environmental variables in a target area or the macroscopic behavior of a target population. In this paper we propose a computation paradigm, which combines computational, collective intelligence and privacy respecting techniques, towards the creation of a flexible, low-cost, secure, massively parallel virtual computing platform based on people's own devices. Examples of how such an infrastructure can be the platform of the deployment of innovative, computationally demanding, applications and services that demand peer-to-peer connections and users' device collaboration are presented. The privacy respecting techniques enhance people's trust in providing their data through their personal devices.

关键词： Collective Intelligence Crowd Sourcing distributed computation IoT Privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：