发布求助
文献互助 智能选刊 最新文献

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.最新文献

筛选
英文 中文
Design of connection management module for MOM MOM连接管理模块的设计
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267653
Tae-Gun Kang, Kang-Min Sohn, In-Chol Jeong
{"title":"Design of connection management module for MOM","authors":"Tae-Gun Kang, Kang-Min Sohn, In-Chol Jeong","doi":"10.1109/ISPDC.2003.1267653","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267653","url":null,"abstract":"MOM technology has become a key component of an enterprise application server which is usually deployed to process business logics. It has to cope with hundreds or even thousands of concurrent connections at the same time. In this end, the efficient and scalable connection management is required for large scale of clients' requests, and various network transport protocols must be taken into consideration when designing the network module of MOM. To facilitate the full support of PTP (Point-to-Point) and publish/subscribe messaging domains, and group communication service featured by MoIM-Message which is our MOM, this paper proposes three types of primitive messaging operations, \"synchronous send\", \"synchronous receive\", and \"asynchronous receive\", and describes the architecture of transport protocol adapter which can be extended to employee various transport protocols. Those functions are implemented into the Message Transport Layer of our MOM which is designed to have three hierarchical layers. Moreover \"polling with multiple service thread model\" that is applied into the socket adapter, is described to cope with the large number of concurrent clients' connections efficiently. To support mobile client platform, we ported the Client Runtime modules into IPaq PDA by utilizing PersonalJava.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new method to automatically compute processing times for random walks based distributed algorithms 一种基于分布式随机漫步算法的处理时间自动计算方法
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267640
Thibault Bernard, A. Bui, M. Bui, D. Sohier
{"title":"A new method to automatically compute processing times for random walks based distributed algorithms","authors":"Thibault Bernard, A. Bui, M. Bui, D. Sohier","doi":"10.1109/ISPDC.2003.1267640","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267640","url":null,"abstract":"Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115326789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Performance analysis of speculative concurrency control algorithms based on wait depth limited for distributed database systems 基于等待深度限制的分布式数据库推测并发控制算法的性能分析
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267645
August Climent, M. Bertran, Francesc-Xavier Babot, Josep M. Muixi
{"title":"Performance analysis of speculative concurrency control algorithms based on wait depth limited for distributed database systems","authors":"August Climent, M. Bertran, Francesc-Xavier Babot, Josep M. Muixi","doi":"10.1109/ISPDC.2003.1267645","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267645","url":null,"abstract":"Distributed Database Management Systems offer advantages and new possibilities to centralized database systems. However, some aspects and issues need to receive further consideration. Concurrency control is one of these aspects that has to be improved in order to increase system performance. Strict Two Phase locking s2pl is the concurrency control mechanism that is used in most commercial database systems. The performance of s2pl can be greatly improved using speculative techniques with speculative Two Phase Locking algorithms sp2pl. In this paper we present extensions of the sp2pl algorithm based on Wait Depth Limited techniques wdl-sp2pl. A comprehensive simulation model is developed from which the performance of sp2pl and the wdl-sp2pl’s are evaluated. Our analysis also shows that the new algorithms give a better performance than sp2pl, maintaining the robustness of sp2pl.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125932394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the load distribution and performance of meta-computing systems 元计算系统负载分配与性能研究
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267667
I. Savvas, Mohand Tahar Kechadi
{"title":"On the load distribution and performance of meta-computing systems","authors":"I. Savvas, Mohand Tahar Kechadi","doi":"10.1109/ISPDC.2003.1267667","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267667","url":null,"abstract":"In this paper, we study a high-performance Heterogeneous Distributed System (HDS) that is employed as a computing platform or grid. Precisely, we study the problem of scheduling a large number of CPU-intensive tasks on such systems. In this study, the time spent by a task in the system is considered as the main issue that needs to be minimized. The proposed techniques of scheduling dynamic tasks consist of two heuristic algorithms; Recursive Neighbor Search (RNS) and Augmented Tabu-Search (ATS) algorithm. Our technique does not address directly the load-balancing problem since it is completely unrealistic in such large environments, but we will show that even a nonperfectly load-balanced system can behave reasonably well by taking into account the tasks' time demands. These algorithms are compared to a well known scheduling algorithm, in order to compare, evaluate, and clarify their performance.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132321549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Fault injection into verilog models for dependability evaluation of digital systems 数字系统可靠性评估的故障注入verilog模型
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267675
H. Zarandi, S. Miremadi, A. Ejlali
{"title":"Fault injection into verilog models for dependability evaluation of digital systems","authors":"H. Zarandi, S. Miremadi, A. Ejlali","doi":"10.1109/ISPDC.2003.1267675","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267675","url":null,"abstract":"This paper presents transient and permanent fault injection into Verilog models of digital systems during the design phase by a developed simulation-based fault injection tool called INJECT. With this fault injection tool, it is possible to inject crucial fault models in all abstraction levels (such as swith-level) supported by Verilog HDL. Several fault models for injecting into Verilog models are specified and described. Analyzing the results obtained from the fault injections, using INJECT enables system designers to inform from dependable parameters, such as fault latency, propagation and coverage. As a case study, a 32-bit processor, namely DP32, has been evaluated and effects of faults on some important observation points have been presented. In this study, recovered errors are distinguished from those that affected the system behavior. The errors that lead to wrong results are separated from those that do not affect the correct results.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131306140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
A framework for self-optimizing, fault-tolerant, high performance bulk data transfers in a heterogeneous grid environment 在异构网格环境中实现自优化、容错、高性能批量数据传输的框架
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267655
T. Kosar, George Kola, M. Livny
{"title":"A framework for self-optimizing, fault-tolerant, high performance bulk data transfers in a heterogeneous grid environment","authors":"T. Kosar, George Kola, M. Livny","doi":"10.1109/ISPDC.2003.1267655","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267655","url":null,"abstract":"The drastic increase in the data requirements of scientific applications combined with an increasing trend towards collaborative research has resulted in the need to transfer large amounts of data among the participating sites. The general approach to transferring such large amounts of data has been to either dump data to tapes and mail them or employ scripts with an operator at each site to babysit the transfers to deal with failures. We introduce a framework which automates the whole process of data movement between different sites. The framework does not require any human intervention and it can recover automatically from various kinds of storage system, network, and software failures, guaranteeing completion of the transfers. The framework has sophisticated monitoring and tuning capability that increases the performance of the data transfers on the fly. The framework also generates on-the-fly visualization of the transfers making identification of problems and bottlenecks in the system simple.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126100624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Resource performance management on computational grid 计算网格的资源性能管理
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267666
O. José, L. M. Suárez, E. Huedo, R. Montero, I. Llorente
{"title":"Resource performance management on computational grid","authors":"O. José, L. M. Suárez, E. Huedo, R. Montero, I. Llorente","doi":"10.1109/ISPDC.2003.1267666","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267666","url":null,"abstract":"The ability to have applications draw computing power from a global resource pool to achieve high performance has become a new challenge for distributed computing and Internet technologies. This challenge not only involves solving technical difficulties in the construction of Grid environments, it also involves resource sharing and performance concerns. This paper presents a resource performance manager that fits in the current Globus implementation of computational Grids, and shows how it can aid in the Grid's expansion, illustrated by some experiments carried out on the UCM-CAB testbed.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131405190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Proposal of an analytical solution for the load imbalance problem in parallel systems 提出了并联系统负载不平衡问题的解析解
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267660
M. Nour, S. Shaheen, G. F. El-Kabbany, Nadia Hegazy
{"title":"Proposal of an analytical solution for the load imbalance problem in parallel systems","authors":"M. Nour, S. Shaheen, G. F. El-Kabbany, Nadia Hegazy","doi":"10.1109/ISPDC.2003.1267660","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267660","url":null,"abstract":"In this paper, a parallel dynamic load balancing algorithm; which offers a good trade-off between the balancing degree and communication costs; is proposed. The proposed algorithm is analyzed, investigated, and implemented. Also, a new mathematical solution for that algorithm is presented. The analytical solution is tested on standard task graphs (STG) as common test-bed benchmarks. All the different parameters concerned with processors, memory, interconnection networks, and task programs are also presented. The new proposed algorithm is compared and evaluated with a traditional dynamic load balancing one. Experimental results are presented by considering a set of criteria for evaluating the overall performance. Simulation and analytical results proved that the proposed algorithm outperforms the chosen one.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127691211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data dependence analysis for intra-register vectorization 寄存器内矢量化的数据依赖性分析
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267643
P. Bulić, V. Gustin
{"title":"Data dependence analysis for intra-register vectorization","authors":"P. Bulić, V. Gustin","doi":"10.1109/ISPDC.2003.1267643","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267643","url":null,"abstract":"There are a number of data dependence tests that have been proposed in the literature. In each test there is a different trade-off between accuracy and efficiency. The most widely used approximate data dependence tests are the Banerjee inequality and the GCD test; whereas the Omega test is a well-known exact data dependence test. \u0000 \u0000In this paper we present a new, fast data dependence test for array references with linear subscripts, which is used in a vectorizing compiler for microprocessors with a multimedia extension. Our test is suitable for use in a dependence analyser that is organized as a series of tests, progressively increasing in accuracy, as a replacement for the GCD or Banerjee tests.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graphical design tool for parallel programs with execution control based on global application states 基于全局应用状态的并行程序执行控制的图形化设计工具
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267641
J. Borkowski, M. Tudruj, D. Kopanski
{"title":"Graphical design tool for parallel programs with execution control based on global application states","authors":"J. Borkowski, M. Tudruj, D. Kopanski","doi":"10.1109/ISPDC.2003.1267641","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267641","url":null,"abstract":"New high-level control mechanisms for design of parallel programs are introduced in the paper. Special synchronizer processes collect information on application parallel process states and construct strongly consistent global states, using time interval timestamps. Based on consistent global states, synchronization and execution control predicates are evaluated by the synchronizers. As a result, synchronization/control signals are sent to application processes. The signals can trigger asynchronous computation activation or cancellation. The proposed synchronization framework is integrated with a message passing system and included into GRADE graphical parallel program design environment. Architecture and implementation aspects of such system are discussed.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131774486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信