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

Network distributed finite element analysis

ADVANCES IN ENGINEERING SOFTWARE 1996年第2-3期25卷 267-280页

作者： Chadha, HS Baugh, JW Department of Civil Engineering North Carolina State University Raleigh NC 27695 USA

The widespread availability of local-area networks has made the combined processing power of workstations a viable approach for compute-intensive analyses. In this paper, we describe several distributed algorithms for structural analysis using finite element methods, and we assess their performance on a conventional Ethernet-connected workstation network. Direct, iterative and hybrid equation solvers are evaluated for their performance on plane-elasticity problems, and are contrasted with respect to overall solution time and efficiency in distributing computations over a network. Equations modeling the costs of network communication and structural analysis computations are derived, and are subsequently used to predict the performance of several variations on the implemented algorithms. Our results show that each of the methods performs well on network architectures, and in particular that, while direct methods usually minimize network communication, certain iterative and hybrid methods can often be used to minimize overall solution time. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited.

关键词： distributed programming concurrent algorithms direct and iterative equation solvers computer networks finite element analysis

来源：评论

学校读者我要写书评

暂无评论

HANDLING TIMING ERRORS IN distributed PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1988年第10期14卷 1525-1535页

作者： GORDON, AJ FINKEL, RA UNIV WISCONSIN MADISONWI 53706 UNIV KENTUCKY DEPT COMP SCILEXINGTONKY 40506

In a distributed environment, events occur concurrently on different processors. The order in which events occur cannot be easily determined; a program that works correctly one time may fail subsequently if the timing between processors changes. For this research, we have investigated distributed program bugs that depend on the relative order between events. We describe a tool (called TAP) to aid the programmer in discovering the causes of timing errors in running programs. TAP, a tool similar to a postmortem debugger, uses the history of interprocess communication to construct a timing graph, a directed graph where an edge joins node x to node y if event x directly precedes event y in time. The programmer can then use TAP to look at the graph to find the events that occurred in an unacceptable order. Because of the nondeterministic nature of distributed programs, we feel a history-keeping mechanism must always be active so that bugs can be dealt with as they occur. Our goal is to collect enough information at run time to construct the timing graph if needed. Since it is always active, this mechanism must be efficient. We also describe experiments run using TAP and report the impact that TAP's history-keeping mechanism has on the running time of various distributed programs. [ABSTRACT FROM AUTHOR]

关键词： distributed programming Index Terms-Debugging timing errors

来源：评论

学校读者我要写书评

暂无评论

An empirical study of local-decision-making-based software customization in distributed development

引用

IET SOFTWARE 2021年第2期15卷 174-187页

作者： Ghiduk, Ahmed S. Qahtani, Abdulrahman M. Taif Univ Coll Comp & Informat Technol At Taif Saudi Arabia Beni Suef Univ Dept Math & Comp Sci Fac Sci Bani Suwayf Egypt

Making a decision for the requirements of multi-stakeholders is a key process, especially in distributed software development projects. Local decision-making for requirements in distributed software development is really difficult to accomplish as well as communicating these requirements over organizational boundaries and conveying them to the offshore developers is a big task. This study presents an empirical evaluation for the effectiveness of local decision-making on the customization process of the software in the distributed development against productivity and cost reduction. This empirical evaluation utilizes the Communicating Customization Requirements of Multi-Clients in a distributed Domain (CCRD) model. The empirical study estimates the productivity of CCRD in terms of the number of requirements for which decisions are made. In addition, the study estimates the reduction in the total cost of the customization process in terms of the salaries of the required local decision-makers. Besides, this study finds the critical point at which the CCRD is still valid (i.e. the minimum number of requirements that violate the significance and worthy of CCRD). The study uses a real data set of 18 clients distributed through 16 cities and involved in one customization project requested about 3000 requirements collected in 1290 working hours. The results of this study showed that the local decision-making improved the productivity of the customization process from 503 requirements in 200 min of simulation to 1,499 requirements. In addition, it reduced 41.5% of the cost. Besides, the results showed that the minimum number of requirements at which CCRD is still valid is 112 requirements.

关键词： cost reduction decision making distributed programming organisational aspects project management software engineering

来源：评论

学校读者我要写书评

暂无评论

Grid computing environments

引用

COMPUTING IN SCIENCE & ENGINEERING 2003年第2期5卷 68-72页

作者： Fox, G Indiana Univ Community Grids Lab Bloomington IN 47405 USA

Grid aspects that form grid computing environments (GCEsare not cleanlydefined, although there is an operational definition stemming from the work areas of the GCEresearch group of the Global Grid Forum. We describe the two major areas covered by this researchgroup today. First we discuss programming the grid and follow with a discussion of portals thatcontrol the user view of the grid. Together they provide a linked component model for the middlewareand user interface to the grid.

关键词： middleware user interfaces distributed programming grid computingenvironments Global Grid Forum programming middleware user interface

来源：评论

学校读者我要写书评

暂无评论

Reactive Caching for Composed Services Polling at the Speed of Push

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第OOPSLA期2卷 1–28页

作者： Burckhardt, Sebastian Coppieters, Tim Microsoft Res Redmond WA 98052 USA Vrije Univ Brussel Brussels Belgium

Sometimes, service clients repeat requests in a polling loop in order to refresh their view. However, such polling may be slow to pick up changes, or may increase the load unacceptably, in particular for composed services that disperse over many components. We present an alternative reactive polling API and reactive caching algorithm that combines the conceptual simplicity of polling with the efficiency of push-based change propagation. A reactive cache contains a summary of a distributed read-only operation and maintains a connection to its dependencies so changes can be propagated automatically. We first formalize the setting using an abstract calculus for composed services. Then we present a fault-tolerant distributed algorithm for reactive caching that guarantees eventual consistency. Finally, we implement and evaluate our solution by extending the Orleans actor framework, and perform experiments on two benchmarks in a distributed cloud deployment. The results show that our solution provides superior performance compared to polling, at a latency that comes close to hand-written change notifications.

关键词： Services distributed programming Reactive programming Actor Model Virtual Actors

来源：评论

学校读者我要写书评

暂无评论

ProbSky: Efficient Computation of Probabilistic Skyline Queries Over distributed Data

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2023年第5期35卷 5173-5186页

作者： Kuo, Ai-Te Chen, Haiquan Tang, Liang Ku, Wei-Shinn Qin, Xiao Auburn Univ Dept Comp Sci & Software Engn Auburn AL 36849 USA Calif State Univ Dept Comp Sci Sacramento CA 90032 USA Facebook Menlo Pk CA 94025 USA

Skyline queries have been widely used in various application domains including multi-criteria decision making, search pruning, and personalized recommendation systems. Given multiple criteria, skyline queries prune the search space of a large collection of multi-dimensional objects to a small set by returning objects that are not dominated by or superior to others. As an extension of the traditional skyline queries, probabilistic skyline queries aim to cope with uncertain datasets. This paper presents a novel MapReduce-based framework, ProbSky, in support of fast parallel distributed evaluation of probabilistic skyline queries on large high-dimensional data. ProbSky is adept at efficiently evaluating exact p-skyline queries on large uncertain data without compromising the quality of query results. From the theoretical point of view, we formally prove two pruning lemmas integrated with ProbSky to strengthen the early pruning capacity. ProbSky builds on top of three optimization techniques: dominant instance pruning, slab-based partitioning, and reference point-based acceleration. These extensive experiments driven by both real and synthetic datasets, reveal that compared to the state-of-the-art methods ProbSky speeds up the evaluation of the exact p-skyline queries on large high dimensional data by at least one order of magnitude in most cases. Our experimental results also validate that by balancing the memory consumption and execution time among machines, ProbSky is adroit at curbing the bottleneck effect that causes severe system performance deterioration.

关键词： Probabilistic logic Query processing Partitioning algorithms distributed databases Scalability Probability density function Search problems Decision making distributed databases parallel programming distributed programming MapReduce skyline query probabilistic skyline query query processing

来源：评论

学校读者我要写书评

暂无评论

Intelligent products -: a step towards a more effective project delivery chain

引用

COMPUTERS IN INDUSTRY 2003年第2期50卷 141-151页

作者： Kärkkäinen, M Holmström, J Främling, K Artto, K Aalto Univ Dept Ind Engn & Management FIN-02015 Helsinki Finland

International projects present really difficult logistics challenges. In international investment projects, a vast number of individualised deliveries has to be managed through a large supply network in a tight timeframe. This article investigates how the logistic challenges of international projects can be solved by utilising advanced web technologies and product identification. The paper presents a control system being built at Helsinki University of Technology, which is based on distributed programming, and wireless identification technologies. The aim of the system is to change the controlling mechanisms of project deliveries by giving the deliveries themselves the means with which to control their route. This enables the material flows in the project delivery chains to be controlled from the inside of the material flow itself. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： project management project delivery chain identification technology distributed programming information management

来源：评论

学校读者我要写书评

暂无评论

PaRSRC: Exploiting Heterogeneity to Enhance Scalability

引用

COMPUTING IN SCIENCE & ENGINEERING 2013年第6期15卷 36-45页

作者： Bosilca, George Bouteiller, Aurelien Danalis, Anthony Faverge, Mathieu Herault, Thomas Dongarra, Jack J. Univ Tennessee Innovat Comp Lab Knoxville TN 37996 USA Bordeaux Inst Technol Bordeaux France Univ Tennessee Knoxville TN 37996 USA

New high-performance computing system designs with steeply escalating processor and core counts, burgeoning heterogeneity and accelerators, and increasingly unpredictable memory access times call for one or more dramatically new programming paradigms. These new approaches must react and adapt quickly to unexpected contentions and delays, and they must provide the execution environment with sufficient intelligence and flexibility to rearrange the execution to improve resource utilization. The authors present an approach based on task parallelism that reveals the application's parallelism by expressing its algorithm as a task flow. This strategy allows the algorithm to be decoupled from the data distribution and the underlying hardware, since the algorithm is entirely expressed as flows of data. This kind of layering provides a clear separation of concerns among architecture, algorithm, and data distribution. Developers benefit from this separation because they can focus solely on the algorithmic level without the constraints involved with programming for current and future hardware trends.

关键词： programming Computer Architecture Runtime Computational Modeling Parallel Processing Biological System Modeling Adaptation Models Scalability programming Paradigms programming Computer Architecture Runtime Computational Modeling Parallel Processing Biological System Modeling Adaptation Models Scalability Scientific Computing High Performance Computing HPC Scheduling And Task Partitioning distributed programming

来源：评论

学校读者我要写书评

暂无评论

Blackboard relations in the μLog coordination model

引用

NEW GENERATION COMPUTING 2001年第1期19卷 23-55页

作者： Jacquet, JM De Bosschere, K Univ Namur Dept Comp Sci Namur Belgium State Univ Ghent Dept Elect & Informat Syst B-9000 Ghent Belgium

This paper describes coordination relations, that are relations that induce the presence or absence of data on some dataspaces from the presence or absence of other data oil other dataspaces. To that end we build upon previous work on the mu Log model and show that the coordination relations carl be easily incorporated in it. This is achieved, on the one hand, by means of novel auxiliary operations, not classically used in Linda-like languages, and, on the other hand, by a translation technique reducing: the extended mu Log model to the core model augmented with the auxiliary operations. Among the most significant ones are multiple read and get operations on a blackboard, readall and getall operations, and tests for the absence of data on blackboards. Although simple, the form of coordination relations we propose is quite powerful as evidenced by a few examples including relations coming from the object-oriented paradigm such as inheritance relations.

关键词： coordination models blackboard relations logic programming distributed programming

来源：评论

学校读者我要写书评

暂无评论

A Medium-Scale distributed System for Computer Science Research: Infrastructure for the Long Term

引用

COMPUTER 2016年第5期49卷 54-63页

作者： Bal, Henri Epema, Dick de laat, Cees van Nieuwpoort, Rob Romein, John Seinstra, Frank Snoek, Cees Wijshoff, Harry VU Univ Amsterdam VU High Performance Distributed Comp Amsterdam Netherlands Delft Univ Technol Distributed Syst NL-2600 AA Delft Netherlands Univ Amsterdam Syst & Network Engn NL-1012 WX Amsterdam Netherlands Netherlands eSci Ctr Technol Amsterdam Netherlands ASTRON Amsterdam Netherlands Netherlands eSci Ctr eSci Program Amsterdam Netherlands Univ Amsterdam Comp Sci NL-1012 WX Amsterdam Netherlands Leiden Univ Comp Sci NL-2300 RA Leiden Netherlands

The Dutch Advanced School for Computing and Imaging has built five generations of a 200-node distributed system over nearly two decades while remaining aligned with the shifting computer science research agenda. The system has supported years of award-winning research, underlining the benefits of investing in a smaller-scale, tailored design.

关键词： computer science distributed processing computer science research medium-scale distributed system Image processing Optical fiber networks Peer-to-peer computing programming Protocols Supercomputers collaborative computing computer architecture computer science research computing for education distributed architectures distributed programming distributed systems e-science research experimental environments heterogeneous computing homogeneous system organization network optimization parallel architectures research infrastructures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：