期刊文献+
共找到546篇文章
< 1 2 28 >
每页显示 20 50 100
The group search-based parallel algorithm for the serial Monte Carlo inversion method 被引量:3
1
作者 魏超 李小凡 郑晓东 《Applied Geophysics》 SCIE CSCD 2010年第2期127-134,193,共9页
With the development of parallel computing technology,non-linear inversion calculation efficiency has been improving.However,for single-point search-based non-linear inversion methods,the implementation of parallel al... With the development of parallel computing technology,non-linear inversion calculation efficiency has been improving.However,for single-point search-based non-linear inversion methods,the implementation of parallel algorithms is a difficult issue.We introduce the idea of group search to the single-point search-based non-linear inversion algorithm, taking the quantum Monte Carlo method as an example for two-dimensional seismic wave velocity inversion and practical impedance inversion and test the calculation efficiency of using different node numbers.The results show the parallel algorithm in theoretical and practical data inversion is feasible and effective.The parallel algorithm has good versatility. The algorithm efficiency increases with increasing node numbers but the algorithm efficiency rate of increase gradually decreases as the node numbers increase. 展开更多
关键词 non-linear inversion single-point search group search parallel computation
下载PDF
Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems 被引量:8
2
作者 Pei Wang Gerhard Reinelt Yuejin Tan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第2期208-215,共8页
A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely no... A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis. 展开更多
关键词 non-identical parallel machine scheduling problem with multiple time windows (NPMSPMTW) oversubscribed self- adaptive large neighborhood search (SALNS) machine learning.
下载PDF
Topology Search of 3-DOF Translational Parallel Manipulators with Three Identical Limbs for Leg Mechanisms 被引量:4
3
作者 WANG Mingfeng CECCARELLI Marco 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第4期666-675,共10页
Three-degree of freedom(3-DOF) translational parallel manipulators(TPMs) have been widely studied both in industry and academia in the past decades. However, most architectures of 3-DOF TPMs are created mainly on ... Three-degree of freedom(3-DOF) translational parallel manipulators(TPMs) have been widely studied both in industry and academia in the past decades. However, most architectures of 3-DOF TPMs are created mainly on designers' intuition, empirical knowledge, or associative reasoning and the topology synthesis researches of 3-DOF TPMs are still limited. In order to find out the atlas of designs for 3-DOF TPMs, a topology search is presented for enumeration of 3-DOF TPMs whose limbs can be modeled as 5-DOF serial chains. The proposed topology search of 3-DOF TPMs is aimed to overcome the sensitivities of the design solution of a 3-DOF TPM for a LARM leg mechanism in a biped robot. The topology search, which is based on the concept of generation and specialization in graph theory, is reported as a step-by-step procedure with desired specifications, principle and rules of generalization, design requirements and constraints, and algorithm of number synthesis. In order to obtain new feasible designs for a chosen example and to limit the search domain under general considerations, one topological generalized kinematic chain is chosen to be specialized. An atlas of new feasible designs is obtained and analyzed for a specific solution as leg mechanisms. The proposed methodology provides a topology search for 3-DOF TPMs for leg mechanisms, but it can be also expanded for other applications and tasks. 展开更多
关键词 topology search 3-DOF translational parallel manipulators(TPMs) creative design leg mechanisms
下载PDF
Application of a Parallel Adaptive Cuckoo Search Algorithm in the Rectangle Layout Problem 被引量:1
4
作者 Weimin Zheng Mingchao Si +2 位作者 Xiao Sui Shuchuan Chu Jengshyang Pan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第6期2173-2196,共24页
The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter stra... The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization. 展开更多
关键词 Rectangular layout cuckoo search algorithm parallel communication strategy adaptive parameter
下载PDF
A Multiple-Neighborhood-Based Parallel Composite Local Search Algorithm for Timetable Problem
5
作者 颜鹤 郁松年 《Journal of Shanghai University(English Edition)》 CAS 2004年第3期301-308,共8页
This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can... This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms. 展开更多
关键词 multiple neighborhoods parallel composite local search algorithm timetable problem.
下载PDF
Evolutionary Neural Architecture Search and Its Applications in Healthcare 被引量:1
6
作者 Xin Liu Jie Li +3 位作者 Jianwei Zhao Bin Cao Rongge Yan Zhihan Lyu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第4期143-185,共43页
Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human ... Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications. 展开更多
关键词 Neural architecture search evolutionary computation large-scale multiobjective optimization distributed parallelism healthcare
下载PDF
Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function
7
作者 Boris S. Verkhovsky 《International Journal of Communications, Network and System Sciences》 2011年第9期549-561,共13页
In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting.... In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner programming problems, describe relations between results for every pair of successive evaluations of function f in parallel. Properties of optimal search strategies are derived from these equations. The worst-case complexity analysis shows that, if the maximizer is located on a priori unknown interval (n-1], then it can be detected after cp(n)=「2log「p/2」+1(n+1)」-1 parallel evaluations of f(x), where p is the number of processors. 展开更多
关键词 Adversarial MINIMAX Analysis DESIGN Parameters Dynamic Programming FUNCTION Evaluation Optimal ALGORITHM parallel ALGORITHM System DESIGN Statistical Experiments Time Complexity Unbounded search UNIMODAL FUNCTION
下载PDF
Using Feedforward Net for Direct Sequence Parallel Search Acquisition
8
作者 全庆一 《High Technology Letters》 EI CAS 1995年第2期83-85,共3页
A feedforward net that quickly determines the maximum of a set of real values and its application in direct sequence parallel search acquisition (DSPSA) are described. The net is very suitable for a VLSI implementatio... A feedforward net that quickly determines the maximum of a set of real values and its application in direct sequence parallel search acquisition (DSPSA) are described. The net is very suitable for a VLSI implementation due to its primary feedforward structure. 展开更多
关键词 Neural network Spread spectrum communication parallel search acquisition
下载PDF
Prime Box Parallel Search Algorithm: Searching Dynamic Dictionary in O(lg m) Time
9
作者 Amit Pandey Berhane Wolde-Gabriel Elias Jarso 《Journal of Computer and Communications》 2016年第4期134-145,共12页
Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a... Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size. 展开更多
关键词 Prime Box search Algorithm Information Retrieval Lexicographical search Dynamic Dictionary search parallel search
下载PDF
Parallel Multiple Tabu Search for Multiobjective Urban Transit Scheduling Problem
10
作者 Vikneswary Uvaraja Lai Soon Lee +1 位作者 Nor Aliza Abd Rahmin Hsin Vonn Seow 《Journal of Computer and Communications》 2020年第5期14-54,共41页
Urban Transit Scheduling Problem (UTSP) is concerned with determining reliable transit schedules for buses and drivers by considering the preferences of both passengers and operators based on the demand and the set of... Urban Transit Scheduling Problem (UTSP) is concerned with determining reliable transit schedules for buses and drivers by considering the preferences of both passengers and operators based on the demand and the set of transit routes. This paper considered a UTSP which consisted of frequency setting, timetabling, and simultaneous bus and driver scheduling. A mixed integer multiobjective model was constructed to optimize the frequency of the routes by minimizing the number of buses, passenger’s waiting times and overcrowding. The model was further extended by incorporating timeslots in determining the frequencies during peak and off-peak hours throughout the time period. The timetabling problem studied two different scenarios which reflected the preferences of passengers and operators to assign the bus departure times at the first and last stop of a route. A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. Computational experiments were conducted on the well-known Mandl’s and Mumford’s benchmark networks to assess the effectiveness of the proposed algorithm. Competitive results are reported based on the performance metrics, as compared to other algorithms from the literature. 展开更多
关键词 Urban TRANSIT Scheduling MULTIPLE Tabu search parallel Frequency SETTING TIMETABLING Big Data
下载PDF
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
11
作者 Sinan Sameer Mahmood Al-Dabbagh Nawaf Hazim Barnouti +1 位作者 Mustafa Abdul Sahib Naser Zaid G. Ali 《Journal of Computer and Communications》 2016年第13期1-11,共11页
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that... String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm. 展开更多
关键词 String Matching Pattern Matching String searching ALGORITHMS Quick search Algorithm Exact String Matching Algorithm ? parallelization OPENMP
下载PDF
A Parallel Search System for Dynamic Multi-Objective Traveling Salesman Problem
12
作者 Weiqi Li 《Journal of Mathematics and System Science》 2014年第5期295-314,共20页
This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very u... This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very useful for routing in ad-hoc networks. The proposed search system first uses parallel processors to identify the extreme solutions of the search space for each ofk objectives individually at the same time. These solutions are merged into the so-called hit-frequency matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The search system is implemented in two different ways master-worker architecture and pipeline architecture. 展开更多
关键词 dynamic multi-objective optimization traveling salesman problem parallel search algorithm solution attractor.
下载PDF
A Parallel String Searching Algorithm for Information Filtering
13
作者 Jin Shu(1),Liu Fengyu(2)(1.NAEG System Integration Engineering Co.Ltd,Nanjing,210003,P.R.China 2.Nanjing University of Science & Technology,Computer Science Department,210094,P.R.China) 《工程科学(英文版)》 2007年第3期82-90,100,共10页
Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the k... Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited. 展开更多
关键词 STRING searchING INFORMATION FILTERING parallel ALGORITHM PBM ALGORITHM
下载PDF
Performance Characterization of Parallel Game-tree Search Application Crafty
14
作者 谭膺 罗克露 +1 位作者 陈玉荣 张益民 《Journal of Electronic Science and Technology of China》 2006年第2期155-160,共6页
Game-tree search plays an important role in the field of Artificial Intelligence (AI). In this paper, we characterize one parallel game-tree search workload in chess: the latest version of Crafty, a state of art pr... Game-tree search plays an important role in the field of Artificial Intelligence (AI). In this paper, we characterize one parallel game-tree search workload in chess: the latest version of Crafty, a state of art program, on two Intel Xeon shared-memory multiprocessor systems. Our analysis shows that Crafty is latency-sensitive and the hash-table and dynamic tree splitting used in Crafty cause large scalability penalties. They consume 35%-50% of the running time on the 4-way system. Furthermore, Crafty is not bandwidth-limited. 展开更多
关键词 performance characterization workload analysis parallel game-tree search computer chess crafty
下载PDF
A local space transfer learning-based parallel Bayesian optimization with its application
15
作者 Luhang Yang Xixiang Zhang +2 位作者 Jingyi Lu Zhou Tian Wenli Du 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2024年第10期227-237,共11页
The optimization of process parameters in polyolefin production can bring significant economic benefits to the factory.However,due to small data sets,high costs associated with parameter verification cycles,and diffic... The optimization of process parameters in polyolefin production can bring significant economic benefits to the factory.However,due to small data sets,high costs associated with parameter verification cycles,and difficulty in establishing an optimization model,the optimization process is often restricted.To address this issue,we propose using a transfer learning Bayesian optimization strategy to improve the efficiency of parameter optimization while minimizing resource consumption.Specifically,we leverage Gaussian process(GP)regression models to establish an integrated model that incorporates both source and target grade production task data.We then measure the similarity weights of each model by comparing their predicted trends,and utilize these weights to accelerate the solution of optimal process parameters for producing target polyolefin grades.In order to enhance the accuracy of our approach,we acknowledge that measuring similarity in a global search space may not effectively capture local similarity characteristics.Therefore,we propose a novel method for transfer learning optimization that operates within a local space(LSTL-PBO).This method employs partial data acquired through random sampling from the target task data and utilizes Bayesian optimization techniques for model establishment.By focusing on a local search space,we aim to better discern and leverage the inherent similarities between source tasks and the target task.Additionally,we incorporate a parallel concept into our method to address multiple local search spaces simultaneously.By doing so,we can explore different regions of the parameter space in parallel,thereby increasing the chances of finding optimal process parameters.This localized approach allows us to improve the precision and effectiveness of our optimization process.The performance of our method is validated through experiments on benchmark problems,and we discuss the sensitivity of its hyperparameters.The results show that our proposed method can significantly improve the efficiency of process parameter optimization,reduce the dependence on source tasks,and enhance the method's robustness.This has great potential for optimizing processes in industrial environments. 展开更多
关键词 Transfer learning Bayesian optimization Process parameters parallel framework Local search space
下载PDF
Lower Bounds and a Nearly Fastest General Parallel Branch-and-Bound Algorithm 被引量:2
16
作者 Wu, Jigang Xie, Xing +1 位作者 Wan, Yingyu Chen, Guoliang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2000年第3期65-73,共9页
In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log ... In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree. 展开更多
关键词 BRANCH-AND-BOUND State-space tree Active list parallel algorithm Combinatorial search.
下载PDF
Nearest neighbor search algorithm based on multiple background grids for fluid simulation 被引量:2
17
作者 郑德群 武频 +1 位作者 尚伟烈 曹啸鹏 《Journal of Shanghai University(English Edition)》 CAS 2011年第5期405-408,共4页
The core of smoothed particle hydrodynamics (SPH) is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth... The core of smoothed particle hydrodynamics (SPH) is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced. Through tested on lid driven cavity flow, it is clear that this method can provide high accuracy. Analysis and experiments have been made on its parallelism, and the results show that this method has better parallelism and with adding processors its accuracy become higher, thus it achieves that efficiency grows in pace with accuracy. 展开更多
关键词 multiple background grids smoothed particle hydrodynamics (SPH) nearest neighbor search algorithm parallel computing
下载PDF
A Hybrid Estimation of Distribution Algorithm for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times 被引量:7
18
作者 Ling Wang Shengyao Wang Xiaolong Zheng 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI 2016年第3期235-246,246+236-245,共12页
A hybrid estimation of distribution algorithm (EDA) with iterated greedy (IG) search (EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times (UPMSP-SDST).... A hybrid estimation of distribution algorithm (EDA) with iterated greedy (IG) search (EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times (UPMSP-SDST). For makespan criterion, some properties about neighborhood search operators to avoid invalid search are derived. A probability model based on neighbor relations of jobs is built in the EDA-based exploration phase to generate new solutions by sampling the promising search region. Two types of deconstruction and reconstruction as well as an IG search are designed in the IG-based exploitation phase. Computational complexity of the algorithm is analyzed, and the effect of parameters is investigated by using the Taguchi method of design-of-experiment. Numerical tests on 1640 benchmark instances are carried out. The results and comparisons demonstrate the effectiveness of the EDA-IG. Especially, the bestknown solutions of 531 instances are updated. In addition, the effectiveness of the properties is also demonstrated by numerical comparisons. © 2014 Chinese Association of Automation. 展开更多
关键词 BENCHMARKING Computational complexity Design of experiments MACHINERY OPTIMIZATION SCHEDULING Taguchi methods
下载PDF
Distributed and Parallel Component Library
19
作者 XUZheng-quan XUYang YANAi-ping 《Wuhan University Journal of Natural Sciences》 EI CAS 2005年第2期375-379,共5页
Software component library is the essential part of reuse-based softwaredevelopment. It is shown that making use of a single component library to store all kinds ofcomponents and from which components are searched is ... Software component library is the essential part of reuse-based softwaredevelopment. It is shown that making use of a single component library to store all kinds ofcomponents and from which components are searched is very inefficient. We construct multi-librariesto support software reuse and use PVM as development environments to imitate large-scale computer,which is expected to fulfill distributed storage and parallel search of components efficiently andimprove software reuse. 展开更多
关键词 software reuse component library parallel virtual machine distributedstorage parallel search
下载PDF
A Parallel Algorithm for Global Optimization Problems in a Distribuited Computing Environment
20
作者 Marco Gaviano Daniela Lera Elisabetta Mereu 《Applied Mathematics》 2012年第10期1380-1387,共8页
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world problems. Since its computational complexity is exponential, its solution can be a very expensive computational task. ... The problem of finding a global minimum of a real function on a set S Rn occurs in many real world problems. Since its computational complexity is exponential, its solution can be a very expensive computational task. In this paper, we introduce a parallel algorithm that exploits the latest computers in the market equipped with more than one processor, and used in clusters of computers. The algorithm belongs to the improvement of local minima algorithm family, and carries on local minimum searches iteratively but trying not to find an already found local optimizer. Numerical experiments have been carried out on two computers equipped with four and six processors;fourteen configurations of the computing resources have been investigated. To evaluate the algorithm performances the speedup and the efficiency are reported for each configuration. 展开更多
关键词 RANDOM search GLOBAL Optimization parallel COMPUTING
下载PDF
上一页 1 2 28 下一页 到第
使用帮助 返回顶部