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

Flexible and extensible load balancing

SOFTWARE-PRACTICE & EXPERIENCE 1997年第11期27卷 1283-1306页

作者： Hui, CC Chanson, ST Department of Computer Science Hong Kong Univ. of Sci. and Technol. Clear Water Bay Hong Kong

This paper presents the design philosophy and implementation of the BALANCE system. BALANCE Is a flexible, network independent and computer architecture independent load balancing system which allows the building of reusable parallel and distributed applications. By implementing related services as generic servers with their connection endpoints registered in BALANCE, the clients can easily access the servers by server system calls. To demonstrate the flexibility of BALANCE, several widely different applications have been implemented and evaluated, including system servers, parallel and distributed applications and a scheduling testbed. The use of generic servers to improve system modularity and code reuse is also discussed. (C) 1997 by John Wiley & Sons, Ltd.

关键词： load balancing load sharing workstation clusters processor scheduling algorithms parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Future trends in model management systems: parallel and distributed extensions

引用

DECISION SUPPORT SYSTEMS 1998年第4期22卷 325-335页

作者： Mayer, MK Univ Virginia Dept Syst Engn Charlottesville VA 22903 USA

A model management system (MMS) is a computer system which aids in the organization, utilization, and execution of models for decision makers. Currently, MMS frameworks do not provide an estimate of computer resource consumption rates for solvers, or permit alternate computational models. Without an estimate of computer resource consumption rates, the decision maker is unable to evaluate alternative solution approaches to select the most efficient. Even with such an estimate, MMS may fail the analyst if all strategies require computation time which exceeds the deadline. This is largely due to the fact the MMS only permits sequential computation. MMS prototypes limit execution of solvers to sequential, so alternative computational models such as Single Program Multiple Datastream and Multiple Input Multiple Datastream, cannot be used. MMS frameworks should be extended to provide algorithmic complexity of solvers as an evaluation measure and to incorporate parallel computational models. Networks of workstations connected by an Ethernet are an attractive low cost means of providing concurrent execution, and suit the flexible processing needs of MMS. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： model management systems parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant algorithms for broadcasting on the star graph network

引用

IEEE TRANSACTIONS ON COMPUTERS 1997年第12期46卷 1357-1362页

作者： Lo, NW Carlson, BS Tao, DL SUNY Stony Brook Dept Elect Engn Stony Brook NY 11794 USA

Fault tolerant algorithms are presented for broadcasting on the star graph. In our algorithm, fault tolerance is achieved by constructing an isomorphism of the star network, such that the faulty nodes minimally disrupt the message passing sequence. It is shown that, in the presence of r(1 less than or equal to r less than or equal to k-2) faults, at most r extra steps are required by our algorithm to perform a one-to-all broadcasting in the k-star network. Our algorithm has the same time complexity as an optimal broadcasting algorithm, and, since it takes advantage of the hierarchical nature of the star graph network, it can be implemented easily. Our algorithm can also be used to perform all-to-all broadcasting in a faulty star graph.

关键词： fault tolerance star graph parallel and distributed computing multiprocessor systems interconnection network

来源：评论

学校读者我要写书评

暂无评论

Strong Reliability of Star Graphs Interconnection Networks

引用

IEEE TRANSACTIONS ON RELIABILITY 2022年第3期71卷 1241-1254页

作者： Lin, Limei Huang, Yanze Hsieh, Sun-Yuan Xu, Li Fujian Normal Univ Coll Math & Informat Key Lab Network Secur & Cryptol Fuzhou 350117 Peoples R China Fujian Normal Univ Ctr Appl Math Fujian Prov Fuzhou 350117 Peoples R China Fujian Univ Technol Inst Machine Learning & Intelligent Sci Sch Math & Phys Fuzhou 350118 Peoples R China Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan

For interconnection network losing processors, it is considerable to calculate the number of vertices in the maximal component in the surviving network. Moreover, the component connectivity is a significant indicator for reliability of a network in the presence of failing processors. In this article, we first prove that when a set M of at most 3n - 7 processors is deleted from an n -star graph, the surviving graph has a large component of size greater or equal to n! - vertical bar M vertical bar - 3 . We then prove that when a set M of at most 4n - 9 processors is deleted from an n -star graph, the surviving graph has a large component of size greater or equal to n!-vertical bar M vertical bar-5 . Finally, we also calculate the r -component connectivity of the n -star graph for 2 <= r <= 5 .

关键词： Fault tolerance maximal component parallel and distributed computing reliability star graphs

来源：评论

学校读者我要写书评

暂无评论

An Algebraic Multigrid-Based Physical Factorization Preconditioner for the Multi-Group Radiation Diffusion Equations in Three Dimensions

引用

Numerical Mathematics(Theory,Methods and Applications) 2023年第2期16卷 410-432页

作者： Xiaoqiang Yue Zekai Zhang Xiaowen Xu Shuying Zhai Shi Shu National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationHunan Key Laboratory for Computation and Simulation in Science and EngineeringXiangtan UniversityXiangtan 411105China Laboratory of Computational Physics Institute of Applied Physics and Computational MathematicsBeijing 100094China School of Mathematical Sciences Huaqiao UniversityQuanzhou 362021China.

The paper investigates the robustness and parallel scaling properties of a novel physical factorization preconditioner with algebraic multigrid subsolves in the iterative solution of a cell-centered finite volume discretization of the threedimensional multi-group radiation diffusion *** key idea is to take advantage of a particular kind of block factorization of the resulting system matrix and approximate the left-hand block matrix selectively spurred by parallel processing *** spectral property of the preconditioned matrix is then *** practical strategy is considered sequentially and in ***,numerical results illustrate the numerical robustness,computational efficiency and parallel strong and weak scalabilities over the real-world structured and unstructured coupled problems,showing its competitiveness with many existing block preconditioners.

关键词： Radiation diffusion equations physical factorization preconditioning algebraic multigrid parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Mobile Java RMI support over heterogeneous wireless networks: A case study

引用

JOURNAL OF parallel and distributed computing 2008年第11期68卷 1425-1436页

作者： Chen, Chung-Kai Chen, Cheng-Wei Ko, Chien-Tan Lee, Jenq-Kuen Chen, Jyh-Cheng Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

distributed object-oriented platforms are increasingly important in wireless environments to provide frameworks for collaborative computation and for managing a large pool of distributed resources. One of the important layers for implementing distributed computing in such environments is via remoting mechanisms. For example, Java uses Remote Method Invocation (RMI) for handling distributed controls. In this paper, we investigate the support for this important layer on wireless environments and address the issues to support Java RMI over heterogeneous wireless environments. We present a case study for supporting Java RMI in Bluetooth, GPRS, and WLAN environments, which represents an important middleware for component communications. The Bluetooth layer is supported by incorporating a set of protocol stack layers for Bluetooth, known as JavaBT that has been developed by us, and by supporting an L2CAP layer with sockets to support Java RMI sockets. RMI over GPRS/WLAN is achieved by RMI implementation over IP layer. Our support for the roaming of Java RMI over heterogeneous wireless networks is based on the concept of direct connection, which avoids the problems caused by forwarding. The difficulty of this strategy is how to handle the existing connection when the mobile node moves to another location so as to avoid interruption of the high-level applications. We solve this problem in Java RMI by the support of dynamic addresses and dynamic sockets. We also propose algorithms to handle the handoff process. In addition, methods for connect-loss detection and data-integrity maintenance in dealing with roaming scenarios are also *** Grande benchmarks are used to demonstrate that our RMI implementations over GPRS, WLAN, and Bluetooth networks are effective in supporting parallel and distributed control of Java layers in heterogeneous wireless environments. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Java RMI support Heterogeneous wireless computing Component software in overlaying networks Service middleware for wireless environments parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Medical Images Indexing and Retrieval in a distributed computing Environment

引用

JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2010年第5期42卷 61-71页

作者： Kurochka, K. S. Safonau, I. V. Gomel State PO Sukhoi Tech Univ Belarus Gomel BELARUS Natl Acad Sci Belarus State Sci Org United Inst Informat Problems Gomel BELARUS

The problem of indexing and retrieval of medical of images in computer networks is considered. The technique and technology of organization of distributed search of images, using Grid resources, is described. The data... 详细信息

关键词： distributed computing environment medical images indexing and retrieval Grid computing segment local area network organization of the Grid environment parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

A scalable parallel genetic algorithm for the Generalized Assignment Problem

引用

parallel computing 2015年 46卷 98-119页

作者： Liu, Yan Y. Wang, Shaowen Univ Illinois CyberGIS Ctr Adv Digital & Spatial Studies Urbana IL 61801 USA Univ Illinois CyberInfrastruct & Geospatial Informat Lab CIGI Urbana IL 61801 USA Univ Illinois Dept Geog & Geog Informat Sci Urbana IL 61801 USA Univ Illinois Natl Ctr Supercomp Applicat Urbana IL 61801 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA Univ Illinois Dept Urban & Reg Planning Urbana IL 61801 USA

Known as an effective heuristic for finding optimal or near-optimal solutions to difficult optimization problems, a genetic algorithm (GA) is inherently parallel for exploiting high performance and parallel computing resources for randomized iterative evolutionary computation. It remains to be a significant challenge, however, to devise parallel genetic algorithms (PGAs) that can scale to massively parallel computer architecture (also known as the mainstream supercomputer architecture) primarily because: (1) a common PGA design adopts synchronized migration, which becomes increasingly costly as more processor cores are involved in global synchronization; and (2) asynchronous PGA design and associated performance evaluation are intricate due to the fact that PGA is a type of stochastic algorithm and the amount of computation work needed to solve a problem is not simply dependent on the problem size. To address the challenge, this paper describes a scalable coarse-grained PGA–PGAP, for a well-known NP-hard optimization problem: Generalized Assignment Problem (GAP). Specifically, an asynchronous migration strategy is developed to enable efficient deme interactions and significantly improve the overlapping of computation and communication. Buffer overflow and its relationship with migration parameters were investigated to resolve the issues of observed message buffer overflow and the loss of good solutions obtained from migration. Two algorithmic conditions were then established to detect these issues caused by communication delays and improper configuration of migration parameters and, thus, guide the dynamic tuning of PGA parameters to detect and avoid these issues. A set of computational experiments is designed to evaluate the scalability and numerical performance of PGAP. These experiments were conducted for large GAP instances on multiple supercomputers as part of the National Science Foundation Extreme Science and Engineering Discovery Environment (XSEDE). Results

关键词： Generalized Assignment Problem Genetic algorithm Heuristics parallel and distributed computing Scalability

来源：评论

学校读者我要写书评

暂无评论

A job profile oriented scheduling architecture for improving the throughput of industrial printing environments

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2015年 88卷 191-205页

作者： do Carmo, Andriele Busatto Raeder, Mateus Nunes, Thiago Kolberg, Mariana Fernandes, Luiz Gustavo GMAP PPGCC PUCRS BR-90619900 Porto Alegre RS Brazil INF PPGC UFRGS BR-91501970 Porto Alegre RS Brazil

The Digital Printing industry has become extremely specialized in the past few years. The use of personalized documents has emerged as a consolidated trend in this field. In order to meet this demand, languages to describe templates for personalized documents were proposed along with procedures which allow the correct printing of such documents. One of these procedures, which demands a high computational effort, is the ripping phase performed over a queue of documents in order to convert them into a printable format. An alternative to decrease the ripping phase computational time is to use high performance computing techniques to allow parallel ripping of different documents. However, such strategies present several unsolved issues. One of the most severe issues is the impossibility to assure a fair load balancing for any job queue. In this scenario, this work proposes a job profile oriented scheduling architecture for improving the throughput of industrial printing environments through a more efficient use of the available resources. Our results show a performance gain of up to 10% in average over the previous existing strategies applied on different job queue scenarios. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Scheduling High performance printing Documents ripping Load balancing Documents profiling parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks

引用

THEORETICAL COMPUTER SCIENCE 2019年 757卷 56-67页

作者： Cheng, Eddie Qiu, Ke Shen, Zhizhang Oakland Univ Dept Math & Stat Rochester MI 48309 USA Brock Univ Dept Comp Sci St Catharines ON L2S 3A1 Canada Plymouth State Univ Dept Comp Sci & Technol Plymouth NH 03264 USA

We discuss a general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. As demonstrative examples, we derive the 1- and 2-good-neighbor conditional diagnosabilities of the arrangement graphs under both the commonly adopted PMC and MM* model. We also derive the general g-good-neighbor conditional diagnosability of the (n, k)-star graphs under the PMC model for g is an element of [1, n - k], and under the MM* model for g is an element of [2, n - k], as well as that of the related graphs, such as the star graph, the alternating group graph, and the alternating group network. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Fault tolerance property R-h-restricted connectivity g-Good-neighbor conditional diagnosability Arrangement graph (n, k)-Star graph parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：