標(biāo)題: Titlebook: Distributed and Parallel Computing; 6th International Co Michael Hobbs,Andrzej M. Goscinski,Wanlei Zhou Conference proceedings 2005 Springe [打印本頁(yè)] 作者: DEIGN 時(shí)間: 2025-3-21 16:35
書目名稱Distributed and Parallel Computing影響因子(影響力)
書目名稱Distributed and Parallel Computing影響因子(影響力)學(xué)科排名
書目名稱Distributed and Parallel Computing網(wǎng)絡(luò)公開度
書目名稱Distributed and Parallel Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Distributed and Parallel Computing被引頻次
書目名稱Distributed and Parallel Computing被引頻次學(xué)科排名
書目名稱Distributed and Parallel Computing年度引用
書目名稱Distributed and Parallel Computing年度引用學(xué)科排名
書目名稱Distributed and Parallel Computing讀者反饋
書目名稱Distributed and Parallel Computing讀者反饋學(xué)科排名
作者: Ligament 時(shí)間: 2025-3-21 23:57
0302-9743 become the computing mainstream. This implies a need for new architectures of parallel and distributed systems, new system management facilities, and new applic978-3-540-29235-7978-3-540-32071-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: armistice 時(shí)間: 2025-3-22 04:15 作者: 廣口瓶 時(shí)間: 2025-3-22 08:01 作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-22 09:20
Localization Techniques for Cluster-Based Data Grid,d technique is to reduce inter-cluster communication overheads and to speed the execution of data parallel programs in the underlying distributed cluster grid. The theoretical analysis and experimental results show improvement of communication costs and scalable of the proposed techniques on different hierarchical cluster grids.作者: Evacuate 時(shí)間: 2025-3-22 15:24 作者: Evacuate 時(shí)間: 2025-3-22 20:47 作者: 細(xì)絲 時(shí)間: 2025-3-23 00:33
https://doi.org/10.1057/9780230270381ltiple datasets from multiple data sources. The algorithm builds a resource set for a job that minimizes the cost or time depending on the user’s preferences and deadline and budget constraints. We evaluate the algorithm on a Data Grid testbed and present the results.作者: Ornithologist 時(shí)間: 2025-3-23 03:35 作者: indemnify 時(shí)間: 2025-3-23 08:12
https://doi.org/10.1057/9780230253193ry service that provides for automated cluster management and resource discovery. The proposed service has an ability to share or recover unused computing resources, and to adapt to transient conditions autonomically, as well as the capability of providing dynamically scalable virtual computers on demand.作者: Pedagogy 時(shí)間: 2025-3-23 13:37
https://doi.org/10.1057/9780230253193ntioned architecture. We propose new techniques for fast management of a frequent itemset mining parallel algorithm. The technique allow us to exhibit statistical results about the activity of more that one hundred PCs connected to the web.作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-23 16:36
https://doi.org/10.1057/9780230253193vice request by composition efficiently. In this paper we present the concept of “invocation layer” based on data dependency between web services invocation and design the algorithms to get the least invocation layers of candidate web services satisfying the given service request.作者: 榨取 時(shí)間: 2025-3-23 20:47
https://doi.org/10.1057/9780230253193ty of the proposed framework is that it uses passive replication approach under high system load and active replication approach under low system loads. The switch between these two replication methods is also done dynamically and transparently.作者: delusion 時(shí)間: 2025-3-24 01:37 作者: 圖表證明 時(shí)間: 2025-3-24 05:52 作者: Licentious 時(shí)間: 2025-3-24 09:29
A Comparative Study at the Logical Level of Centralised and Distributed Recovery in Clusters,ow a recovery facility, based on either a centralised or distributed approach could be implemented into a cluster that is supported by a checkpointing facility. This recovery facility can then recover failed user processes by using checkpoints of the processes that have been taken during failure free execution.作者: 背信 時(shí)間: 2025-3-24 13:51
Toward Self Discovery for an Autonomic Cluster,ry service that provides for automated cluster management and resource discovery. The proposed service has an ability to share or recover unused computing resources, and to adapt to transient conditions autonomically, as well as the capability of providing dynamically scalable virtual computers on demand.作者: Firefly 時(shí)間: 2025-3-24 15:58 作者: ALIAS 時(shí)間: 2025-3-24 20:32
Setup Algorithm of Web Service Composition,vice request by composition efficiently. In this paper we present the concept of “invocation layer” based on data dependency between web services invocation and design the algorithms to get the least invocation layers of candidate web services satisfying the given service request.作者: MELON 時(shí)間: 2025-3-25 00:28
Fault-Tolerant Dynamic Job Scheduling Policy,ty of the proposed framework is that it uses passive replication approach under high system load and active replication approach under low system loads. The switch between these two replication methods is also done dynamically and transparently.作者: 歌劇等 時(shí)間: 2025-3-25 03:58 作者: Anhydrous 時(shí)間: 2025-3-25 08:01 作者: 具體 時(shí)間: 2025-3-25 15:13 作者: Cognizance 時(shí)間: 2025-3-25 16:27
https://doi.org/10.1057/9780230270381sfer operations as a specific usage case for a more general messaging environment. This will allow us to provide file transfer quality of service to other file transfer tools that does not have same features.作者: WITH 時(shí)間: 2025-3-25 21:53
https://doi.org/10.1057/9780230270732and management of out-of-ordered requests for file server group. Finally, the results of experiments proved the efficiency of the proposed consistency control mechanism. Above all, easy to implement is our main design consideration.作者: 令人悲傷 時(shí)間: 2025-3-26 01:29
https://doi.org/10.1057/9780230270381in face of attacks and rejuvenate the running software or/and service, or/and reconfigure it. It shows that the system operates through intrusions and provides continued the critical functions, and gracefully degrades non-critical system functionality in the face of intrusions.作者: Microaneurysm 時(shí)間: 2025-3-26 06:29 作者: 臨時(shí)抱佛腳 時(shí)間: 2025-3-26 12:32
Improving Concurrent Write Scheme in File Server Group,and management of out-of-ordered requests for file server group. Finally, the results of experiments proved the efficiency of the proposed consistency control mechanism. Above all, easy to implement is our main design consideration.作者: 先驅(qū) 時(shí)間: 2025-3-26 14:45 作者: GIST 時(shí)間: 2025-3-26 17:38
pKSS: An Efficient Keyword Search System in DHT Peer-to-Peer Network,ch as TFIDF and exploits the relationship information between query keywords to improve performance of P2P keyword search. Experimental results clearly demonstrated that the improved keyword search is more efficient than KSS index in insert overhead and storage overhead, and much less than standard inverted index on bandwidth costs for a query.作者: Genetics 時(shí)間: 2025-3-26 21:28
https://doi.org/10.1057/9780230270381al and transactional consistency respectively. Kerrighed is a single system image operating system (OS) based on Linux whereas Plurix is a native OS for PC clusters designed for shared memory operation. The measurements presented in this paper show that strong consistency models implemented at the OS level are competitive.作者: 預(yù)測(cè) 時(shí)間: 2025-3-27 02:38
https://doi.org/10.1057/9780230270381ponsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.作者: maladorit 時(shí)間: 2025-3-27 08:51 作者: 痛得哭了 時(shí)間: 2025-3-27 12:50 作者: Strength 時(shí)間: 2025-3-27 16:20 作者: 遣返回國(guó) 時(shí)間: 2025-3-27 18:47
Reducing the Bandwidth Requirements of P2P Keyword Indexing,ponsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.作者: GUILE 時(shí)間: 2025-3-28 00:32
2-Layered Metadata Service Model in Grid Environment,model in grid environment which utilizes the special locality of users’ distribution and provides a platform for grid data management. We have implemented that 2-layered metadata service model in . (CGSP) – the grid middleware for ChinaGrid project.作者: Calibrate 時(shí)間: 2025-3-28 02:39
Self Healing and Self Configuration in a WSRF Grid Environment,e Grid. This paper addresses the principles of self healing and self configuration in a Grid environment and implements a service using the WSRF.NET framework to investigate the affect and applicability of the Web Services Resource Framework on these principles and improve the WSRF specification.作者: 持久 時(shí)間: 2025-3-28 10:11
https://doi.org/10.1007/11564621DJ; Monitor; Multithreading; Performance; Simulation; algorithm; algorithms; cluster computing; grid computi作者: commune 時(shí)間: 2025-3-28 10:48
978-3-540-29235-7Springer-Verlag Berlin Heidelberg 2005作者: 無(wú)能的人 時(shí)間: 2025-3-28 14:42
https://doi.org/10.1057/9780230270732e reliability and availability of system, to achieve the expected reduction in operational expenses and to reduce the operations of management of system have become essential issues. A basic technique for improving reliability of a file system is to mask the effects of failures through replication. 作者: maculated 時(shí)間: 2025-3-28 20:58
https://doi.org/10.1057/9780230270381eir simulation performance study is presented with the assumption that they use multicast communication if possible. To formally represent the algorithms for simulation, a class of extended Petri nets is used. The simulation was done in the simulation system Winsim based on this class of Petri nets.作者: Glaci冰 時(shí)間: 2025-3-29 02:18 作者: GEON 時(shí)間: 2025-3-29 04:43 作者: excursion 時(shí)間: 2025-3-29 11:10
https://doi.org/10.1057/9780230270381 have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the fi作者: 勾引 時(shí)間: 2025-3-29 14:55
https://doi.org/10.1057/9780230270381tems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, leaf set forwarding and conventional techniques such as aggressive index pru作者: 仇恨 時(shí)間: 2025-3-29 16:55 作者: 步履蹣跚 時(shí)間: 2025-3-29 22:02
https://doi.org/10.1057/9780230270381ally. In due course, the system will not provide even the minimum critical functionality. Thus we propose a model to increase the cluster system survivability level by maintaining the essential functionality. In this paper, we present the cluster recovery model with a software rejuvenation methodolo作者: 不能仁慈 時(shí)間: 2025-3-30 03:20
https://doi.org/10.1057/9780230270381gical grid nodes mapping technique is employed to enhance the performance of parallel programs on cluster grid. Cluster grid is a typical computational grid environment consists of several clusters located in multiple campuses that are distributed globally over the Internet. Objective of the propose作者: 意見一致 時(shí)間: 2025-3-30 06:57 作者: electrolyte 時(shí)間: 2025-3-30 11:08
https://doi.org/10.1057/9780230253193soon will be petabytes. The primary problem we face is how to organize the geographical distributed storage devices to support the collaborative operations on data in those resources. On the one hand, performance is critical to such application, but on the other hand the diverse network conditions p作者: 勾引 時(shí)間: 2025-3-30 12:49 作者: exophthalmos 時(shí)間: 2025-3-30 20:23 作者: 到婚嫁年齡 時(shí)間: 2025-3-30 23:12
https://doi.org/10.1057/9780230253193t of hardware failures and cannot manage dynamic cluster membership efficiently. This report presents the logical design of an innovative self discovery service that provides for automated cluster management and resource discovery. The proposed service has an ability to share or recover unused compu作者: 立即 時(shí)間: 2025-3-31 03:11
https://doi.org/10.1057/9780230253193urces that are not available at any time. In this paper, we focus on the different tools available for mining traces of the activities of such aforementioned architecture. We propose new techniques for fast management of a frequent itemset mining parallel algorithm. The technique allow us to exhibit作者: 合群 時(shí)間: 2025-3-31 05:24
https://doi.org/10.1057/9780230253193 problems of web services composition are how to model the input and output data dependency of candidate web services and how to satisfy that of a service request by composition efficiently. In this paper we present the concept of “invocation layer” based on data dependency between web services invo作者: Entropion 時(shí)間: 2025-3-31 10:21
https://doi.org/10.1057/9780230253193amework which provides a basis for web services to access stateful resources. While this allows access to stateful resources, the web services themselves are not stateful. Currently, Grids require a lot of direct involvement of application developers, who are, in general, not computing specialists. 作者: Badger 時(shí)間: 2025-3-31 17:25
https://doi.org/10.1057/9780230253193and substantial progress has already been made towards composed Web Services. In this paper, first, we proposed a life cycle of composed Web services, then designed a model named Service-Cloud model based on the process of forming clouds in nature. Finally, based on Service-Cloud model, we design an作者: 轉(zhuǎn)換 時(shí)間: 2025-3-31 18:22 作者: BLANK 時(shí)間: 2025-3-31 22:42 作者: 步兵 時(shí)間: 2025-4-1 02:15
Study on Life Cycle Model of Dynamic Composed Web Services,and substantial progress has already been made towards composed Web Services. In this paper, first, we proposed a life cycle of composed Web services, then designed a model named Service-Cloud model based on the process of forming clouds in nature. Finally, based on Service-Cloud model, we design and implement a prototype.作者: 噴油井 時(shí)間: 2025-4-1 06:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281965.jpg
