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

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops最新文献

筛选
英文 中文
Jini meets the Grid Jini遇到了Grid
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951941
M. Baker, Garry Smith
{"title":"Jini meets the Grid","authors":"M. Baker, Garry Smith","doi":"10.1109/ICPPW.2001.951941","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951941","url":null,"abstract":"There is an increasing interest in integrating Java-based, and in particular Jini systems, with the emerging Grid infrastructures. In this paper we explore various ways of integrating the key components of each architecture, their directory and information management services. In the first part of the paper we sketch out the Jini and Grid architectures and their services. We then review the components and services that Jini provides and compare these with those of the Grid. In the second part of the paper we critically explore four ways that Jini and the Grid could interact, here in particular we look at possible scenarios that can provide a seamless interface to a Jini environment for Grid clients and how to use Jini services from a Grid environment. In the final part of the paper we summarise our findings and report on future work being undertaken to integrate Jini and the Grid.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"161 1","pages":"193-198"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80199070","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}
引用次数: 11
Design and implementation requirements for CORBA lightweight components CORBA轻量级组件的设计和实现需求
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951952
Diego Sevilla Ruiz, José M. García, A. Gómez-Skarmeta
{"title":"Design and implementation requirements for CORBA lightweight components","authors":"Diego Sevilla Ruiz, José M. García, A. Gómez-Skarmeta","doi":"10.1109/ICPPW.2001.951952","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951952","url":null,"abstract":"This paper describes the guidelines we followed and the requirements we stated while designing and implementing the CORBA Lightweight Components (CORBA-/spl Lscr/C) Component Model. CORBA-/spl Lscr/C is a lightweight distributed reflective component model based on CORBA. Instead of using a traditional client/server model, it imposes a peer network model in which the whole network act as a repository for managing and assigning the whole set of resources: components, CPU cycles, memory, etc. Thus, application deployment is automatically and adaptively performed at run-time. Requirements for component description, packaging, deployment, reflection, logical network cohesion, distributed resource queries and fault-tolerant protocols are identified. Finally, we show the validity of the identified requirements in dealing with CSCW and Grid Computing applications and show how current component models fail on addressing some of these requirements.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"14 1 1","pages":"213-218"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78210235","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}
引用次数: 8
The STEM-II air quality model on a distributed memory system 分布式存储系统上的STEM-II空气质量模型
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951855
J. C. Mouriño, María J. Martín, R. Doallo, D. E. Singh, F. F. Rivera, J. Bruguera
{"title":"The STEM-II air quality model on a distributed memory system","authors":"J. C. Mouriño, María J. Martín, R. Doallo, D. E. Singh, F. F. Rivera, J. Bruguera","doi":"10.1109/ICPPW.2001.951855","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951855","url":null,"abstract":"STEM-II is an Eulerian air quality model which simulates transport, chemical transformations, emissions and depositions processes in an integrated framework. The model is computationally intensive because the governing equations are non-linear, highly coupled and stiff. The purpose of this work is the reduction of CPU time needed by each simulation by means of the parallel implementation of the code to obtain real-time predictions. The improvements achieved on distributed memory systems using the MPI library are shown.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"49 1","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86067852","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}
引用次数: 11
Improving cluster utilization through set based allocation policies 通过基于集合的分配策略提高集群利用率
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951972
David B. Jackson, Brian Haymore, J. Facelli, Q. Snell
{"title":"Improving cluster utilization through set based allocation policies","authors":"David B. Jackson, Brian Haymore, J. Facelli, Q. Snell","doi":"10.1109/ICPPW.2001.951972","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951972","url":null,"abstract":"While clusters have already proven themselves in the world of high performance computing, some clusters are beginning to exhibit resource inefficiencies due to increasing hardware diversity. Much of the success of clusters lies in the use of commodity components built to meet various hardware standards. These standards have allowed a great level of hardware backwards compatibility that is now resulting in a condition referred to as hardware 'drift' or heterogeneity. The hardware heterogeneity introduces problems when diverse compute nodes are allocated to a parallel job, as most parallel jobs are not self-balancing. This paper presents a new method that allows the batch scheduling system to intelligently select the best resource set for a parallel job in order to minimize the adverse effects of hardware drift and increase overall performance of the cluster. The performance improvements of this technique are evaluated in terms of parallel job efficiency and scheduling resource utilization and overall system performance. Using the emulation capabilities of the Maui Scheduler, this paper evaluates a number of variations of the resource set allocation algorithm on true cluster throughput and utilization using a recorded trace workload from a production cluster.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"23 1","pages":"355-360"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83304226","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
Partial stabilization of large-scale discrete-time linear control systems 大型离散线性控制系统的部分镇定
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951856
P. Benner, María Isabel Castillo, E. S. Quintana‐Ortí
{"title":"Partial stabilization of large-scale discrete-time linear control systems","authors":"P. Benner, María Isabel Castillo, E. S. Quintana‐Ortí","doi":"10.1109/ICPPW.2001.951856","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951856","url":null,"abstract":"We propose a parallel algorithm for stabilizing large discrete-time linear control systems on a Beowulf cluster. Our algorithm first separates the Schur stable part of the linear control system using an inverse-free iteration for the matrix disc function, and then computes a stabilizing feedback matrix for the unstable part. This stage requires the numerical solution of a Stein equation. This linear matrix equation is solved using the sign function method after applying a Cayley transformation to the original equation. The experimental results on a cluster composed of Intel PII processors and a Myrinet interconnection network show the parallelism and scalability of our approach.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"10 1","pages":"93-98"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87802261","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}
引用次数: 34
A mechanism for the dynamic construction of clusters using active networks 一种利用主动网络动态构建集群的机制
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951979
P. Graham, Rajendra Singh
{"title":"A mechanism for the dynamic construction of clusters using active networks","authors":"P. Graham, Rajendra Singh","doi":"10.1109/ICPPW.2001.951979","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951979","url":null,"abstract":"In this paper we describe an active networks framework for dynamically constructing clusters in response to user requests for computational service. Active network nodes match requests for computational service to appropriate offers of such service using recent access and predicted usage pattern information to construct clusters on-demand. The active networks approach exploits the fact that network devices are in an ideal position to decide which resources should be combined to build clusters in response to particular requests. This approach offers advantages in terms of anonymity of service (systems are unaware of one anothers' existence), scalability (scheduling is distributed across many network processors), fault tolerance (service is distributed so failures are recoverable and/or localized) and automatic localization (clusters are created as close to the requester as possible).","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"4 1","pages":"403-410"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89110827","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}
引用次数: 2
Stochastic scheduling of a meta-task in heterogeneous distributed computing 异构分布式计算中元任务的随机调度
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951974
A. Doğan, F. Özgüner
{"title":"Stochastic scheduling of a meta-task in heterogeneous distributed computing","authors":"A. Doğan, F. Özgüner","doi":"10.1109/ICPPW.2001.951974","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951974","url":null,"abstract":"The fact that the scheduling problem is NP-complete has motivated the development of many heuristic scheduling algorithms. These heuristic algorithms often neglect the stochastic nature of tasks' execution times. Contrary to existing heuristics, in this study, tasks' execution times are treated as random variables and the stochastic scheduling problem is formulated accordingly. Using this formulation, it is theoretically shown that current deterministic scheduling algorithms may perform poorly in a real computing environment. In order to support the theoretical foundations, a genetic algorithm based scheduling algorithm is devised to make scheduling decisions either stochastically or deterministically by changing only the fitness function of chromosomes. The simulation studies conducted show that deploying a stochastic scheduling algorithm instead of a deterministic one can improve the performance of meta-tasks in a heterogeneous distributed computing system.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"353 1","pages":"369-374"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76468067","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}
引用次数: 10
A resource reservation protocol in wireless mobile networks 无线移动网络中的一种资源预留协议
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951982
Minsik Kim, Young-Joo Suh, Youngjae Kim, Young Choi
{"title":"A resource reservation protocol in wireless mobile networks","authors":"Minsik Kim, Young-Joo Suh, Youngjae Kim, Young Choi","doi":"10.1109/ICPPW.2001.951982","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951982","url":null,"abstract":"Host mobility is a new service that has been introduced in world wide deployment of the Internet. Providing QoS to mobile hosts is a challenging area because of its mobility. The resource reservation protocol (RSVP) establishes and maintains a reservation state to ensure a given QoS level between the sender and receiver. However, RSVP is designed for fixed networks and thus inadequate in the mobile networking environment. We propose a resource reservation protocol for mobile hosts. The proposed protocol extends RSVP and introduces RSVP agents to manage reservations in local networks. The proposed protocol reduces packet delay, bandwidth overhead without giving additional load to the backbone network, and the number of RSVP messages to maintain reservation states. We examined the performance of the proposed protocol by simulation.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"112 1","pages":"429-434"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79634821","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}
引用次数: 15
Computing period minimization for function-block simulation in parallel processing systems 并行处理系统中功能块仿真的计算周期最小化
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951914
Hee-Jun Park, Byung Kook Kim
{"title":"Computing period minimization for function-block simulation in parallel processing systems","authors":"Hee-Jun Park, Byung Kook Kim","doi":"10.1109/ICPPW.2001.951914","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951914","url":null,"abstract":"The aim of our research is to develop the optimal task scheduling algorithm that minimizes the computing period in general network structures considering communication contention and routing delay. We present new ideas of scheduling: (i) the individual start that allows overlapping two different iterations, (ii) the scheduling space and the scheduling graph that represent feasible schedules, and (iii) the check-and-diffusion algorithm utilizing property of the start-time difference vs. The computing period. With concrete examples of scheduling spaces, segments, and schedules, we show that individual start reduces the computing period, and our algorithm can find the optimal start-time difference.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"68 1","pages":"122-127"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75314721","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
Displacement decomposition and parallelization of the PCG method for elasticity problems 弹性问题的PCG方法的位移分解与并行化
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951923
R. Blaheta, O. Jakl, J. Starý
{"title":"Displacement decomposition and parallelization of the PCG method for elasticity problems","authors":"R. Blaheta, O. Jakl, J. Starý","doi":"10.1109/ICPPW.2001.951923","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951923","url":null,"abstract":"This article describes the displacement decomposition and its benefits for the parallelization of the preconditioned conjugate gradient method for finite element elasticity problems. It deals with both the fixed and variable preconditioning based on this decomposition. Numerical efficiency of the parallel algorithms is demonstrated on an academic benchmark and real-life modelling problem.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"36 1","pages":"155-160"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77242143","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信