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

Capacitor placement for switching noise reduction using genetic algorithms and distributed computing

ELECTRICAL ENGINEERING 2005年第1期87卷 11-18页

作者： Karaki, SH Kayssi, AI Karaki, HS Amer Univ Beirut Dept Elect & Comp Engn Beirut Lebanon

This work investigates capacitor placement on a printed circuit board (PCB) to reduce the effect of simultaneous switching noise as a genetic algorithm (GA) search problem. The solution process makes use of distributed computing resources available on a local area network in order to solve larger problems more efficiently. The objective is to determine the number of added capacitors with minimum cost, and their position on the PCB, while keeping the maximum voltage deviation within some specified noise margin. The presence of capacitors at the selected positions is represented by a stream of zeros and ones, which is interpreted as a genotype. At each generation, the GA assesses the fitness function of a population of genotypes using linear transient circuit analysis, which involves a single matrix inversion, by determining the maximum voltage dip given the capacitor locations. For large systems, the fitness calculations are divided among several processors according to a simple distributed computing algorithm.

关键词： capacitor placement genetic algorithms simultaneous switching noise printed circuit board distributed computing power distribution grid

来源：评论

学校读者我要写书评

暂无评论

DISENTANGLING APPLICATION AND PRESENTATION IN distributed computing - ARCHITECTURE AND PROTOCOL TO ENABLE A FLEXIBLE, COMMON USER INTERFACE

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1988年第4期18卷 561-566页

作者： MULLER, MJ Bell Communications Research Inc. Piscataway NJ USA

The author describes an architecture and a protocol to solve a number of problems that may arise in a distributed computing setting, including incompatible hardware and software environments, incompatible user interfaces, and customization requirements. The focus is on providing an enabling environment for flexible user interface specification that can provide both common functionality and, if needed, local customization. The overall architecture of the solution is described, and examples of the protocol for specifying user interface functionality are presented.< >

关键词： distributed computing Computer architecture User interfaces Access protocols Hardware Software standards Workstations Application software Computer interfaces Microcomputers

来源：评论

学校读者我要写书评

暂无评论

Dynamic two-side matching of tasks and resources in wide-area distributed computing environments

引用

JOURNAL OF SUPERcomputing 2023年第9期79卷 10208-10231页

作者： Song, Yao Wang, Liang Xiao, Limin Shen, Runnan Wang, Jinquan Zhang, Chenhao Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

Recently, wide-area distributed computing environments have become popular due to its huge resource capacities. In the wide-area distributed computing environment, matching between tasks and resources plays an important role in improving system performance. However, the geographically distribution of diverse resources complicates the matching problems, thus degrading the system performance. To achieve an efficient matching between task requirements and resource capacities, this study proposes a dynamic two-side matching of tasks and resources in wide-area distributed computing environments. First, the proposed method establishes the task requirement model and the resource capacity model using a uniform description based on the characteristic analysis to mitigate the impact of diversity and simplify the matching process. Then, a two-side matching degree metric is designed to comprehensively quantify the matching quality between the task requirements and resource capacities. Finally, a resource selection strategy is raised to guide the scheduling based on the matching degree. The experimental results indicate that compared with the state-of-the-art matching methods, the proposed method reduces the overall completion time and response delay by up to 35.60% and 29.28%, respectively.

关键词： distributed computing Two-side matching Task scheduling Collaborative scheduling Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Structural integrity assessment of FBR components using a distributed computing environment

引用

FATIGUE & FRACTURE OF ENGINEERING MATERIALS & STRUCTURES 2003年第9期26卷 847-858页

作者： Rajagopal, A Ravichandran, M Muralidher, NG Sivakumar, SM Indian Inst Technol Dept Appl Mech Madras 600036 Tamil Nadu India Indian Inst Technol Dept Civil Engn Madras 600036 Tamil Nadu India

In this work, the structural integrity of the critical components of the fast breeder reactor (FBR) that are subjected thermal striping is assessed using a fracture mechanics approach based on linear elastic fracture mechanics (LEFM). The structural integrity is assessed in terms of the actual life of the component for a particular difference between the hot and cold liquid temperatures at the critical mixing velocities. A generalized procedure is attempted for the computation of fatigue life. It is demonstrated in this work that the analysis procedure adopted is computationally very efficient. Green's function method is used for transient mode I crack propagation analysis. An inherent parallelism in the method is exploited for computational efficiency. A distributed computing environment is, therefore, used to demonstrate the effectiveness of Green's function method for crack propagation analysis for the kind of problem solved in this work. A simple idealization in the form of flat plate geometry is used in a numerical example to show the computational efficiency. The method shows a good scale-up justifying the benefit of using a distributed computing environment given a large amount of input data for the thermal striping problem.

关键词： distributed computing functional decomposition Green's function structural integrity thermal striping

来源：评论

学校读者我要写书评

暂无评论

Object-oriented distributed computing based on remote class reference

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2003年第1期15卷 79-91页

作者： Huang, Y Walker, DW Rana, OF Cardiff Univ Dept Comp Sci Cardiff CF24 3XF S Glam Wales

Java RMI, Jini and CORBA provide effective mechanisms for implementing a distributed computing system. Recently many numeral libraries have been developed that take advantage of Java as an object-oriented and portable language. The widely-used client-server method limits the extent to which the benefits of the object-oriented approach can be exploited because of the difficulties arising when a remote object is the argument or return value of a remote or local method. In this paper this problem is solved by introducing a data object that stores the data structure of the remote object and related access methods. By using this data object, the client can easily instantiate a remote object, and use it as the argument or return value of either a local or remote method. Copyright (C) 2003 John Wiley Sons, Ltd.

关键词： Java RMI distributed computing remote class reference

来源：评论

学校读者我要写书评

暂无评论

REMOTE DATABASE ACCESS IN THE distributed computing ENVIRONMENT

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第4期24卷 421-434页

作者： WONG, J MARSHALL, W GOODMAN, R IBM CORP ROCHESTERMN 55901

This paper describes the design, implementation and testing of a set of software modules that are used for remote database access in a distributed computing environment. The goal of our research and development is to implement a client server model using Structured Query Language (SQL) functions in the Open Software Foundation's (OSF) distributed computing environment (DCE). This design is compared with another which simply uses the sockets application programming interface (API), running over the transmission control protocol/internet protocol (TCP/IP), and is implemented in subroutines that act similar to the remote procedure call (RPC) generated stub code. The prototypes for the remote SQL access project are implemented using an IBM RISC System/6000 (the client) running the AIX operating system and an IBM AS/400 (the server) running the OS/400 operating system. We selected the AS/400 for its database abilities, and the RISC System/6000 since the DCE software is available for it.

关键词： distributed computing STRUCTURED QUERY LANGUAGE COMMUNICATION DATABASE

来源：评论

学校读者我要写书评

暂无评论

Examination of load-balancing methods to improve efficiency of a composite materials manufacturing process simulation under uncertainty using distributed computing

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2006年第5期22卷 571-587页

作者： Zhang, F Mawardi, A Santos, E Pitchumani, R Achenie, LEK Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA Univ Connecticut Dept Mech Engn Storrs CT 06269 USA Univ Connecticut Dept Chem Engn Storrs CT 06269 USA Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA

Process simulations play an important role in guiding process understanding and development, without requiring costly manufacturing trials. For process design under uncertainty. a large number of simulations is needed for an accurate convergence of the moments of the output distributions, which renders such stochastic analysis computationally intensive. This paper discusses the application of a basic distributed computing approach to reduce the computation time of a composite materials manufacturing process simulation under uncertainty. Specifically. several load-balancing methods are explored and analyzed to determine the best strategies given heterogeneous tasks and heterogeneous networks. especially when the individual task times cannot be predicted. (C) 2005 Elsevier B.V. All rights reserved.

关键词： load balancing distributed computing design under uncertainty pultrusion process simulation processing variability

来源：评论

学校读者我要写书评

暂无评论

Coded distributed computing for Resilient, Secure and Private Matrix-Vector Multiplication in Edge-Enabled Metaverse

引用

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2024年第5期10卷 1944-1958页

作者： Qiu, Houming Zhu, Kun Luong, Nguyen Cong Niyato, Dusit Wu, Qiang Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 210016 Peoples R China Nanjing Univ Aeronaut & Astronaut Collaborat Innovat Ctr Novel Software Technol & In Nanjing 210016 Peoples R China PHENIKAA Univ Fac Comp Sci Hanoi 12116 Vietnam Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore

Metaverse is an immersive and photorealistic shared virtual world that requires efficient rendering and processing of millions of virtual objects and scenes. This leads to the requirements of computing time-sensitive and computation-intensive tasks, primarily focused on matrix multiplication. Cloud computing can be leveraged to process computation-intensive tasks. However, it is not able to meet the ultra-low latency requirements of immersive experiences due to the remote servers. In this paper, we propose an effectively distributed edge computing framework to compute high-dimensional matrix multiplication for the Metaverse. With the distributed edge computing, the high-dimensional matrix multiplication task is divided into multiple smaller subtasks, which are then assigned to nearby edge servers (workers). However, leveraging distributed edge servers raises emerging issues due to the existence of stragglers, malicious, and colluding servers, which limits the applications of distributed edge computing in the Metaverse system. Thus, we design a resilient, secure, and private coded distributed computing (RSPCDC) scheme to jointly address the aforementioned issues. Firstly, the RSPCDC scheme reduces overall computation latency by lowering the recovery threshold. Secondly, to identify malicious (e.g., Byzantine) workers, a verification approach is embedded in the scheme to promptly detect the Byzantine attack without requiring additional workers. Thirdly, the RSPCDC scheme provides (information-theoretic) privacy protection for the input data against the collusion of workers. Fourthly, the results of subtasks computed by stragglers are fully utilized to enhance the computation performance during the recovery of the final result. In addition, the RSPCDC scheme is designed and deployed in practical scenarios in which the computing resources of the workers are heterogeneous. Extensive performance evaluations are provided to demonstrate the improvement and effectiveness of

关键词： Servers Metaverse Task analysis Codes Edge computing distributed computing Polynomials coded distributed computing edge computing stragglers security privacy matrix-vector recovery threshold

来源：评论

学校读者我要写书评

暂无评论

Robust scalable stabilisability conditions for large-scale heterogeneous multi-agent systems with uncertain nonlinear interactions: towards a distributed computing architecture

引用

INTERNATIONAL JOURNAL OF CONTROL 2016年第6期89卷 1203-1213页

作者： Manfredi, Sabato Univ Naples Federico II Dept Elect Engn & Informat Technol Naples Italy Univ London Imperial Coll Sci Technol & Med Elect & Elect Engn Dept Control & Power Grp London England

Large-scale dynamic systems are becoming highly pervasive in their occurrence with applications ranging from system biology, environment monitoring, sensor networks, and power systems. They are characterised by high dimensionality, complexity, and uncertainty in the node dynamic/interactions that require more and more computational demanding methods for their analysis and control design, as well as the network size and node system/interaction complexity increase. Therefore, it is a challenging problem to find scalable computational method for distributed control design of large-scale networks. In this paper, we investigate the robust distributed stabilisation problem of large-scale nonlinear multi-agent systems (briefly MASs) composed of non-identical (heterogeneous) linear dynamical systems coupled by uncertain nonlinear time-varying interconnections. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, new conditions are given for the distributed control design of large-scale MASs that can be easily solved by the toolbox of MATLAB. The stabilisability of each node dynamic is a sufficient assumption to design a global stabilising distributed control. The proposed approach improves some of the existing LMI-based results on MAS by both overcoming their computational limits and extending the applicative scenario to large-scale nonlinear heterogeneous MASs. Additionally, the proposed LMI conditions are further reduced in terms of computational requirement in the case of weakly heterogeneous MASs, which is a common scenario in real application where the network nodes and links are affected by parameter uncertainties. One of the main advantages of the proposed approach is to allow to move from a centralised towards a distributed computing architecture so that the expensive computation workload spent to solve LMIs may be shared among processors located at the networked nodes, thus increasing the scalability of the approach than the network

关键词： distributed computing linear matrix inequality Large-scale multi-agent system stabilisability

来源：评论

学校读者我要写书评

暂无评论

"Semi-Asynchronous": A New Scheduler in distributed computing

引用

IEEE ACCESS 2021年 9卷 41540-41557页

作者： Cicerone, Serafino di Stefano, Gabriele Navarra, Alfredo Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy Univ Perugia Dept Math & Comp Sci I-06123 Perugia Italy

The study of mobile entities that based on local information have to accomplish global tasks is of main interest for the scientific community. Classic models for the activation and synchronization of mobile entities are the fully-synchronous (FSync), semi-synchronous (SSync), and asynchronous (Async) models, where entities alternate between active and inactive states with different timing. According to the assumed synchronization model, very different results have been achieved in the field of distributed computing. One of the main outcomes is the big gap between the Async and the other models in terms of manageability and algorithm design. In fact, there are still many problems for which it is not known whether synchronicity is crucial for designing resolution algorithms or not. In order to better understand the Async case, here we propose a further model referred to as the semi-asynchronous (SAsync). This slightly deviates from SSync. In fact, like in SSync (and FSync), the duration of the activation of an entity is kept of fixed time whereas, like in Async, the starting instant of the activation is not fully synchronized with the possible activation of other entities. We show that for entities moving on graphs, the SSync model allows accomplishing more tasks than the SAsync that in turn allows accomplishing more tasks than the Async. Furthermore, our results show that, especially to tackle problems in the Euclidean plane, the SAsync model is already quite challenging, therefore there is no need to get involved with complications arising in the Async model.

关键词： Robots Computational modeling Synchronization Robot kinematics Task analysis distributed computing Standards distributed algorithms gathering mobile robots synchronization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：