書目名稱Grid and Cooperative Computing影響因子(影響力)學(xué)科排名
書目名稱Grid and Cooperative Computing網(wǎng)絡(luò)公開度
書目名稱Grid and Cooperative Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Grid and Cooperative Computing被引頻次
書目名稱Grid and Cooperative Computing被引頻次學(xué)科排名
書目名稱Grid and Cooperative Computing年度引用
書目名稱Grid and Cooperative Computing年度引用學(xué)科排名
書目名稱Grid and Cooperative Computing讀者反饋
書目名稱Grid and Cooperative Computing讀者反饋學(xué)科排名
作者: Ergots 時(shí)間: 2025-3-21 22:25
Auswahl- und Bewertungsmethodenrarchical data collection structure solves the scalability problem, we synthesized an implementation model to implement the performance data collection in MP systems. This paper presents our synthetic implementation results.作者: affluent 時(shí)間: 2025-3-22 03:43
,Entwickeln von Baureihen und Bauk?sten,ructure to GMA and provides interfaces which match Grid Service standards for all its components and defines metadata for monitoring events. It is a novel infrastructure for Grid monitoring and management with highly modularity, usability and scalability.作者: 柱廊 時(shí)間: 2025-3-22 04:43
Harald Künemund,Simone Schergerm for Grid [1], [8], [9], [10]. In this paper, we propose a new on-line heuristic scheduling algorithm. We show that our scheduling algorithm has better performance than previous scheduling algorithms by extensive simulation.作者: gorgeous 時(shí)間: 2025-3-22 08:58
https://doi.org/10.1057/9781137284235t forward. Then, a multisite Distributed Scheduling Server is designed and its prototype is implemented. A heuristic strategy, Clustering-based Grid Resource Selection algorithm, is described. Experiment indicates the scheduler and the algorithm are effective.作者: Relinquish 時(shí)間: 2025-3-22 15:20 作者: Relinquish 時(shí)間: 2025-3-22 20:59 作者: Diastole 時(shí)間: 2025-3-22 21:51
Leena Mathew M.D.,Lisa Kilcoyne B.A. M.D. executed in parallel. These OpenMP directives include scheduling for irregular loops, inspector/executor for parallelizing irregular reduction, and eliminating ordered loops. We also introduce implementation strategies with respect to these extensions.作者: Osteons 時(shí)間: 2025-3-23 05:08 作者: Hay-Fever 時(shí)間: 2025-3-23 09:21 作者: CRUC 時(shí)間: 2025-3-23 12:26
GMA+ – A GMA-Based Monitoring and Management Infrastructure for Gridructure to GMA and provides interfaces which match Grid Service standards for all its components and defines metadata for monitoring events. It is a novel infrastructure for Grid monitoring and management with highly modularity, usability and scalability.作者: 試驗(yàn) 時(shí)間: 2025-3-23 14:30
An Online Scheduling Algorithm for Grid Computing Systemsm for Grid [1], [8], [9], [10]. In this paper, we propose a new on-line heuristic scheduling algorithm. We show that our scheduling algorithm has better performance than previous scheduling algorithms by extensive simulation.作者: 沉積物 時(shí)間: 2025-3-23 19:10
Multisite Task Scheduling on Distributed Computing Gridt forward. Then, a multisite Distributed Scheduling Server is designed and its prototype is implemented. A heuristic strategy, Clustering-based Grid Resource Selection algorithm, is described. Experiment indicates the scheduler and the algorithm are effective.作者: 無目標(biāo) 時(shí)間: 2025-3-24 01:48
Architecture of Grid Resource Allocation Management Based on QoSorward the architecture of GRAM based on QoS. Through mapping, converting and negotiating the QoS parameters, it can implant the user’s requirement about QoS in the process of resource allocation management, and connect Grid QoS with GRAM very well. All these provide a reasonable consulting model for QoS and resource allocation management in grid.作者: 咽下 時(shí)間: 2025-3-24 02:20 作者: handle 時(shí)間: 2025-3-24 08:59
Effective OpenMP Extensions for Irregular Applications on Cluster Environments executed in parallel. These OpenMP directives include scheduling for irregular loops, inspector/executor for parallelizing irregular reduction, and eliminating ordered loops. We also introduce implementation strategies with respect to these extensions.作者: aqueduct 時(shí)間: 2025-3-24 14:02
Resource Management and Scheduling in Manufacturing GridGRS). The former, MGIS, provides fundamental mechanisms for remote resource encapsulating, registration, and monitoring, and the latter, MGRS, performs scheduling roles as Global Process Planning (GPP) analyzing, resource discovery, resource selection, and resource mapping.作者: 保守 時(shí)間: 2025-3-24 16:18 作者: 整頓 時(shí)間: 2025-3-24 21:30
https://doi.org/10.1007/978-1-4899-6068-9o the genetic algorithm to schedule . jobs to . machines on the Grid. Experiments on a small Grid of four machines have shown a significant reduction of the average execution time by the new job scheduling approach.作者: Inordinate 時(shí)間: 2025-3-24 23:56
https://doi.org/10.1007/978-3-030-55262-6nput places. We construct a simple model for the resource scheduling in grid computing using EHLTPN. A definition of Reachable Scheduling Graph (RSG) of EHLTPN to analyze the timing property of the resource scheduling is given in this paper. Two algorithms can be use to settle the “state explosion” problem while constructing RSG of EHLTPN.作者: Onerous 時(shí)間: 2025-3-25 04:05 作者: MAL 時(shí)間: 2025-3-25 08:25
Adaptive Job Scheduling for a Service Grid Using a Genetic Algorithmo the genetic algorithm to schedule . jobs to . machines on the Grid. Experiments on a small Grid of four machines have shown a significant reduction of the average execution time by the new job scheduling approach.作者: 同音 時(shí)間: 2025-3-25 14:11
Resource Scheduling Algorithms for Grid Computing and Its Modeling and Analysis Using Petri Netnput places. We construct a simple model for the resource scheduling in grid computing using EHLTPN. A definition of Reachable Scheduling Graph (RSG) of EHLTPN to analyze the timing property of the resource scheduling is given in this paper. Two algorithms can be use to settle the “state explosion” problem while constructing RSG of EHLTPN.作者: Circumscribe 時(shí)間: 2025-3-25 17:37 作者: Confidential 時(shí)間: 2025-3-25 21:36
Aaron Van Wright III,Jennifer L. Nelsoned; b) A dataset of a scheduled task is being replicated to a node, at which another task is running; c) Data exchange happens when dependant subtasks are running at different nodes. Corresponding theoretical analysis and experimental results demonstrate that the scheduling approach improves execution performance and resource utilization.作者: 不朽中國 時(shí)間: 2025-3-26 01:38 作者: tenuous 時(shí)間: 2025-3-26 05:27
Fernando Cervero,Jennifer M. A. Lairdling algorithm called GBHA (group-based hybrid algorithm) that eliminates cycles when traversing TTIG, so that global information can be captured. Simulation results show that our algorithm outperforms MATE significantly in homogeneous systems.作者: 平庸的人或物 時(shí)間: 2025-3-26 11:21
A Dynamic Job Scheduling Algorithm for Computational Gridof each node. The scheduler would not allocate a new job to a node that is already fully utilized. The execution efficiency of system will be increased. An implementation framework of the algorithm is also introduced.作者: 抗體 時(shí)間: 2025-3-26 15:58 作者: 庇護(hù) 時(shí)間: 2025-3-26 18:18
Flexible Intermediate Library for MPI-2 Support on an SCore Cluster Systemrouter process mechanism hides a complex network configuration in inter-machine data transfer. In addition, the MPI-2 extensions, dynamic process creation and MPI-I/O, are also available. We have evaluated primitive functions of Stampi and sufficient performance has been achieved and effectiveness of our flexible implementation has been confirmed.作者: 巫婆 時(shí)間: 2025-3-26 22:45 作者: EXULT 時(shí)間: 2025-3-27 01:24
Long-Term Consequences of Neonatal Painperformance, expansibility and usability of computers, and providing incorporate environment and information service. This scheme has universality for computational grid and makes every grid resource work efficiently.作者: NOT 時(shí)間: 2025-3-27 09:07
https://doi.org/10.1007/978-1-4613-4292-2sumed by the users’ programs. We will give an example of scheduling a typical scientific computing task to show the power of our algorithm. In our experiment, the grid resource consists of an SGI Onyx 3900 supercomputer, four SGI Octane workstations, four Intel P4-2.0GHz PCs and four Intel P4-1.8GHz PCs.作者: 容易懂得 時(shí)間: 2025-3-27 10:33
Physical Exam of the Cranial Nervesneighbour strategy is the best among the proposed strategies. Furthermore, the proposed algorithm with best neighbour strategy is better than the traditional round robin algorithm in term of processing delay, and the proposed algorithm needs very limited system information and is robust.作者: Halfhearted 時(shí)間: 2025-3-27 16:42
An Integrated Management and Scheduling Scheme for Computational Gridperformance, expansibility and usability of computers, and providing incorporate environment and information service. This scheme has universality for computational grid and makes every grid resource work efficiently.作者: 逢迎春日 時(shí)間: 2025-3-27 21:13 作者: 解決 時(shí)間: 2025-3-27 23:50 作者: BARB 時(shí)間: 2025-3-28 03:11
Synthetic Implementations of Performance Data Collection in Massively Parallel Systemsm of MP system performance tools and proposed a solution, replacing the two-level data collection structure by hierarchal one. To demonstrate that hierarchical data collection structure solves the scalability problem, we synthesized an implementation model to implement the performance data collectio作者: CODA 時(shí)間: 2025-3-28 08:20
GMA+ – A GMA-Based Monitoring and Management Infrastructure for Gridtage of GMA (Grid Monitoring Architecture), we propose a new monitoring and management schema for Grid –GMA+. In GMA+, we add a close loop feedback structure to GMA and provides interfaces which match Grid Service standards for all its components and defines metadata for monitoring events. It is a n作者: Disk199 時(shí)間: 2025-3-28 12:21 作者: 腐敗 時(shí)間: 2025-3-28 16:04
Selection and Advanced Reservation of Backup Resources for High Availability Service in Computationa during the resource allocation phase and how to make advanced reservation for backup resources are challenging issues for grid environment to provide high availability service. In this paper, we proposed a backup resources selection algorithm base on resources clustering, then devised several polic作者: jaunty 時(shí)間: 2025-3-28 19:43 作者: 領(lǐng)袖氣質(zhì) 時(shí)間: 2025-3-29 02:12 作者: 地名表 時(shí)間: 2025-3-29 04:42
An Integrated Management and Scheduling Scheme for Computational Gridst. However, the management of resources and computational tasks is a critical and complex undertaking as they are geographically distributed, heterogeneous in nature, owned by different individuals or organizations with their own policies, different access, and dynamically varying loads and availab作者: 男學(xué)院 時(shí)間: 2025-3-29 11:13
Multisite Task Scheduling on Distributed Computing Gridthree-level architecture of the distributed computing grid model and a grid schedule model, a scalable environment for multisite task scheduling is put forward. Then, a multisite Distributed Scheduling Server is designed and its prototype is implemented. A heuristic strategy, Clustering-based Grid R作者: conservative 時(shí)間: 2025-3-29 14:07
Adaptive Job Scheduling for a Service Grid Using a Genetic Algorithmaverage execution time of scheduling . jobs to .(≤ .) machines on the Grid. Two models are proposed to predict the execution time of a single job or multiple jobs on each machine with varied system load. The single service type model is used to schedule jobs of one single service to a machine while 作者: phytochemicals 時(shí)間: 2025-3-29 19:36
Resource Scheduling Algorithms for Grid Computing and Its Modeling and Analysis Using Petri Net of tasks, but also expected communication time when calculating expected completion time. In the paper, the execution cost of tasks and budget of application are selected as QoS and an algorithm XMin-min with QoS is also proposed. An extended high-level timed Petri net (EHLTPN) model suiting schedu作者: 錯(cuò)誤 時(shí)間: 2025-3-29 23:32
Architecture of Grid Resource Allocation Management Based on QoS the layered structure of Grid QoS. Based on the analysis of the content of grid resource allocation management (GRAM) based on QoS, this paper puts forward the architecture of GRAM based on QoS. Through mapping, converting and negotiating the QoS parameters, it can implant the user’s requirement ab作者: 愛國者 時(shí)間: 2025-3-30 02:17
An Improved Ganglia-Like Clusters Monitoring Systemlia-like clusters monitoring system, which has more reliability with federation node and associated link failures; some monitoring data is accessed by permission; adding control functions such as restart or shutdown confusion processes; send email or pager to cluster administrator when important eve作者: Esophagus 時(shí)間: 2025-3-30 07:26
Effective OpenMP Extensions for Irregular Applications on Cluster Environmentsutations is called irregular problem. In this paper, we propose some extensions to OpenMP directives, aiming at efficient irregular OpenMP codes to be executed in parallel. These OpenMP directives include scheduling for irregular loops, inspector/executor for parallelizing irregular reduction, and e作者: 有發(fā)明天才 時(shí)間: 2025-3-30 12:15
A Scheduling Approach with Respect to Overlap of Computing and Data Transferring in Grid Computingsferring. On the basis of network status, node load, and the relation between task execution and task data access, data transferring and computing can occur concurrently in the following three cases: a) A task is being executed on a part of its dataset when the other of its dataset is being replicat作者: antiandrogen 時(shí)間: 2025-3-30 12:37 作者: 公共汽車 時(shí)間: 2025-3-30 19:30
A Load Balancing Algorithm for Web Based Server Gridsines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm作者: Nonflammable 時(shí)間: 2025-3-30 21:23 作者: 欲望 時(shí)間: 2025-3-31 02:49 作者: Palter 時(shí)間: 2025-3-31 09:04
A New Task Scheduling Algorithm in Distributed Computing Environmentsracterizing task’s precedence is DAG (directed acyclic graph). In [2], a novel model called TTIG (Temporal Task In Interaction Graph)that is more realistic and universal than DAG and its corresponding algorithm called MATE are presented. This paper extends TTIG model and proposes a new static schedu作者: 讓你明白 時(shí)間: 2025-3-31 13:00 作者: 運(yùn)動(dòng)吧 時(shí)間: 2025-3-31 16:27 作者: 散開 時(shí)間: 2025-3-31 18:35
J?rg Feldhusen,Karl-Heinrich Grotey schedule these tasks to processing elements that communicate data between each other by means of a network. In this paper, we consider task graphs that take into account both, computation and communication costs. For a homogeneous computing system with a fixed number of processing elements we comp作者: alleviate 時(shí)間: 2025-3-31 22:04 作者: Microaneurysm 時(shí)間: 2025-4-1 03:47
Harald Künemund,Simone Schergerlgorithm is highly desirable. Grid is an example of the heterogeneous parallel computer system. Many researchers propose heuristic scheduling algorithm for Grid [1], [8], [9], [10]. In this paper, we propose a new on-line heuristic scheduling algorithm. We show that our scheduling algorithm has bett作者: 思考才皺眉 時(shí)間: 2025-4-1 06:09
Charles F. Stroebel,Bernard C. Glueckation of a practical system to allocate the jobs more evenly. In this algorithm, the communication time between nodes and the scheduler is overlapped with the computation time of the nodes. So the communication overhead can be little. The principle of scheduling the job is based on the desirability 作者: 網(wǎng)絡(luò)添麻煩 時(shí)間: 2025-4-1 14:12 作者: glisten 時(shí)間: 2025-4-1 15:45 作者: 功多汁水 時(shí)間: 2025-4-1 20:51
https://doi.org/10.1007/978-1-4899-6068-9average execution time of scheduling . jobs to .(≤ .) machines on the Grid. Two models are proposed to predict the execution time of a single job or multiple jobs on each machine with varied system load. The single service type model is used to schedule jobs of one single service to a machine while
