首页 > 最新文献

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)最新文献

英文 中文
Symbolic partitioning and scheduling of parameterized task graphs 参数化任务图的符号划分和调度
M. Cosnard, E. Jeannot, Tao Yang
The DAG based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally depend on the problem size. We propose a symbolic scheduling scheme for a parameterized task graph which models coarse grain DAG parallelism, independent of the problem size. The algorithm first derives symbolic clusters to a group of tasks in order to minimize communication while preserving parallelism, and then it evenly assigns task clusters to processors. The run time system executes clusters on each processor in a multithreaded fashion. The paper also presents preliminary experimental results to demonstrate the effectiveness of our techniques.
基于DAG的任务图模型在并行应用程序的性能预测和优化调度方面是有效的。然而,调度复杂度和解决方案通常取决于问题的大小。我们提出了一种独立于问题大小的参数化任务图的符号调度方案,该方案模拟了粗粒度DAG并行性。该算法首先为一组任务派生符号簇,在保持并行性的同时最小化通信,然后将任务簇均匀地分配给处理器。运行时系统以多线程的方式在每个处理器上执行集群。本文还给出了初步的实验结果,以证明我们的技术的有效性。
{"title":"Symbolic partitioning and scheduling of parameterized task graphs","authors":"M. Cosnard, E. Jeannot, Tao Yang","doi":"10.1109/ICPADS.1998.741109","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741109","url":null,"abstract":"The DAG based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally depend on the problem size. We propose a symbolic scheduling scheme for a parameterized task graph which models coarse grain DAG parallelism, independent of the problem size. The algorithm first derives symbolic clusters to a group of tasks in order to minimize communication while preserving parallelism, and then it evenly assigns task clusters to processors. The run time system executes clusters on each processor in a multithreaded fashion. The paper also presents preliminary experimental results to demonstrate the effectiveness of our techniques.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130093901","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
Probability based replacement algorithm for WWW server arrays 基于概率的WWW服务器阵列替换算法
A. Yeung, K. Suen
This paper describes a scalable Web server array architecture which uses a caching policy called the probability based replacement (PBR) algorithm. The server array consists of a central server and several Web servers. The central server stores the whole document set, and sends the user requested documents to the Web servers by a technique called the selective broadcast technique. Web documents are cached in the Web servers and are replaced based on the PBR algorithm. Performance comparison using NASA and ClarkNet access logs between PBR server arrays and purely mirrored Web servers is performed. The results show that with 10% document caching, the maximum throughput of the former one is nearly the same as that of mirrored Web servers. The PBR server arrays, however, require much smaller disk storage in the Web servers than the mirrored Web servers. The PBR server arrays are also much more scalable than the mirrored ones.
本文描述了一种可扩展的Web服务器阵列架构,该架构使用一种称为基于概率替换(PBR)算法的缓存策略。服务器阵列由一个中心服务器和几个Web服务器组成。中央服务器存储整个文档集,并通过一种称为选择性广播技术的技术将用户请求的文档发送到Web服务器。Web文档缓存在Web服务器中,并根据PBR算法进行替换。使用NASA和ClarkNet访问日志在PBR服务器阵列和纯镜像Web服务器之间进行性能比较。结果表明,当文档缓存率为10%时,前者的最大吞吐量与镜像Web服务器的最大吞吐量几乎相同。但是,与镜像Web服务器相比,PBR服务器阵列在Web服务器中需要更小的磁盘存储空间。PBR服务器阵列也比镜像服务器阵列具有更高的可扩展性。
{"title":"Probability based replacement algorithm for WWW server arrays","authors":"A. Yeung, K. Suen","doi":"10.1109/ICPADS.1998.741154","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741154","url":null,"abstract":"This paper describes a scalable Web server array architecture which uses a caching policy called the probability based replacement (PBR) algorithm. The server array consists of a central server and several Web servers. The central server stores the whole document set, and sends the user requested documents to the Web servers by a technique called the selective broadcast technique. Web documents are cached in the Web servers and are replaced based on the PBR algorithm. Performance comparison using NASA and ClarkNet access logs between PBR server arrays and purely mirrored Web servers is performed. The results show that with 10% document caching, the maximum throughput of the former one is nearly the same as that of mirrored Web servers. The PBR server arrays, however, require much smaller disk storage in the Web servers than the mirrored Web servers. The PBR server arrays are also much more scalable than the mirrored ones.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133055339","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
The distributed program reliability analysis on star topologies 星型拓扑下的分布式程序可靠性分析
M. Chang, Deng-Jyi Chen, Min-Sheng Lin, K. Ku
We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with an approximate solution when the star topology is not satisfied with the additional file distribution.
我们证明了星型分布式计算系统上计算分布式程序的可靠性是np困难的。我们提出了一个多项式可解的情况,用于计算一些附加文件分布在星型拓扑结构上的分布式程序可靠性。我们还提出了一种计算分布式程序可靠性的多项式时间算法,该算法在星型拓扑不满足附加文件分布时具有近似解。
{"title":"The distributed program reliability analysis on star topologies","authors":"M. Chang, Deng-Jyi Chen, Min-Sheng Lin, K. Ku","doi":"10.1109/ICPADS.1998.741025","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741025","url":null,"abstract":"We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with an approximate solution when the star topology is not satisfied with the additional file distribution.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116212017","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}
引用次数: 25
Shrinking timestamp sizes of event ordering protocols 缩减事件排序协议的时间戳大小
A. Mostéfaoui, Oliver E. Theel
Almost all published work on causal ordering mechanisms assumes theoretically unbounded counters for timestamps, thus ignoring the real world problem that arises if one is actually interested in an operable implementation, since unbounded counters simply cannot be realized. An argument for its justification often encountered states, that the counter size can be chosen such that counters practically do not overflow or wrap around. For example, using matrix timestamps in a distributed computation involving not more than 50 processes and 32 bits per integer, results in a timestamp size of almost 10 K byte. We present a solution, called Factorized Timestamp Approach (FTA) that substantially reduces the amount of piggybacked control information. It is based on introducing the notion of phases in which much smaller timestamps are used. Simulation results given in the paper show the suitability of this approach.
几乎所有已发表的关于因果排序机制的著作都假定时间戳的计数器在理论上是无界的,因此忽略了在实际对可操作实现感兴趣时出现的现实世界问题,因为无界计数器根本无法实现。对其正当性的论证经常会遇到这样一种情况,即计数器大小的选择可以使计数器实际上不会溢出或缠绕。例如,在涉及不超过50个进程和每个整数32位的分布式计算中使用矩阵时间戳,会导致时间戳大小接近10 K字节。我们提出了一个解决方案,称为分解时间戳方法(FTA),它大大减少了承载控制信息的数量。它基于引入相位的概念,其中使用了更小的时间戳。仿真结果表明了该方法的适用性。
{"title":"Shrinking timestamp sizes of event ordering protocols","authors":"A. Mostéfaoui, Oliver E. Theel","doi":"10.1109/ICPADS.1998.741041","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741041","url":null,"abstract":"Almost all published work on causal ordering mechanisms assumes theoretically unbounded counters for timestamps, thus ignoring the real world problem that arises if one is actually interested in an operable implementation, since unbounded counters simply cannot be realized. An argument for its justification often encountered states, that the counter size can be chosen such that counters practically do not overflow or wrap around. For example, using matrix timestamps in a distributed computation involving not more than 50 processes and 32 bits per integer, results in a timestamp size of almost 10 K byte. We present a solution, called Factorized Timestamp Approach (FTA) that substantially reduces the amount of piggybacked control information. It is based on introducing the notion of phases in which much smaller timestamps are used. Simulation results given in the paper show the suitability of this approach.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988722","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
Implementation and evaluation of the parallel Mesa library 并行Mesa库的实现与评价
T. Mitra, T. Chiueh
Describes the implementation and performance evaluation of a 3D graphics library that can be readily linked with parallel applications to provide run-time visualization on large-scale message-passing parallel machines, such as the Intel Paragon. The prototype implementation is currently fully operational, and is based on Mesa, a public-domain OpenGL implementation, and on a sort-last parallelization strategy. Through a detailed performance analysis, we show that the scalability of the current prototype is close to the theoretical limit for the given hardware architecture. We have also developed a unified framework to describe parallel compositing algorithms and show that two popular parallel compositing algorithms, binary swapping and parallel pipeline compositing, are just two extreme instances of this framework. Such a framework is important because it allows users to tailor the compositing algorithm according to the computation/communication characteristics of specific parallel machines by tuning the parameters appropriately. The current parallel Mesa library prototype implements such a parameterizable family of compositing algorithms.
描述3D图形库的实现和性能评估,该库可以很容易地与并行应用程序链接,以在大型消息传递并行机器(如Intel Paragon)上提供运行时可视化。原型实现目前是完全可操作的,并且基于Mesa(一个公共领域的OpenGL实现)和sort-last并行化策略。通过详细的性能分析,我们表明当前原型的可扩展性接近给定硬件架构的理论极限。我们还开发了一个统一的框架来描述并行合成算法,并展示了两种流行的并行合成算法,二进制交换和并行流水线合成,只是该框架的两个极端实例。这样的框架很重要,因为它允许用户通过适当地调整参数来根据特定并行机器的计算/通信特性定制合成算法。当前的并行Mesa库原型实现了这样一个可参数化的合成算法族。
{"title":"Implementation and evaluation of the parallel Mesa library","authors":"T. Mitra, T. Chiueh","doi":"10.1109/ICPADS.1998.741023","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741023","url":null,"abstract":"Describes the implementation and performance evaluation of a 3D graphics library that can be readily linked with parallel applications to provide run-time visualization on large-scale message-passing parallel machines, such as the Intel Paragon. The prototype implementation is currently fully operational, and is based on Mesa, a public-domain OpenGL implementation, and on a sort-last parallelization strategy. Through a detailed performance analysis, we show that the scalability of the current prototype is close to the theoretical limit for the given hardware architecture. We have also developed a unified framework to describe parallel compositing algorithms and show that two popular parallel compositing algorithms, binary swapping and parallel pipeline compositing, are just two extreme instances of this framework. Such a framework is important because it allows users to tailor the compositing algorithm according to the computation/communication characteristics of specific parallel machines by tuning the parameters appropriately. The current parallel Mesa library prototype implements such a parameterizable family of compositing algorithms.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130362008","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}
引用次数: 24
A share assignment method to maximize the probability of secret sharing reconstruction under the Internet 一种最大化互联网下秘密共享重构概率的份额分配方法
Ching-Yun Lee, Y. Yeh, Deng-Jyi Chen, K. Ku
The use of the Internet for various business applications and resource sharing has grown tremendously over the last few years. In some applications, an important document may be required to be divided into pieces and be allocated in different locations over the Internet for security access concerns. For example, an important map that can be used to access a military base, an important key that can be used to give a military order or command. To access such an important document, one must reconstruct the divided pieces from different locations. In this paper, a probability model for reconstructing the secret sharing under the Internet is proposed. Also, how to assign the divided shares into different locations is studied. Particularly, algorithms to perform share assignment and to reconstruct the divided pieces into the original secret are proposed.
在过去几年中,将Internet用于各种业务应用程序和资源共享的情况有了极大的增长。在某些应用程序中,出于安全访问考虑,可能需要将重要文档分成几个部分,并在Internet上的不同位置进行分配。例如,可以用来进入军事基地的重要地图,可以用来发出军事命令或命令的重要钥匙。要访问如此重要的文件,必须从不同的位置重建分裂的碎片。本文提出了一种重构Internet下秘密共享的概率模型。此外,还研究了如何将分割后的股份分配到不同的位置。特别地,提出了共享分配算法和将分割后的碎片重构为原始秘密的算法。
{"title":"A share assignment method to maximize the probability of secret sharing reconstruction under the Internet","authors":"Ching-Yun Lee, Y. Yeh, Deng-Jyi Chen, K. Ku","doi":"10.1109/ICPADS.1998.741117","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741117","url":null,"abstract":"The use of the Internet for various business applications and resource sharing has grown tremendously over the last few years. In some applications, an important document may be required to be divided into pieces and be allocated in different locations over the Internet for security access concerns. For example, an important map that can be used to access a military base, an important key that can be used to give a military order or command. To access such an important document, one must reconstruct the divided pieces from different locations. In this paper, a probability model for reconstructing the secret sharing under the Internet is proposed. Also, how to assign the divided shares into different locations is studied. Particularly, algorithms to perform share assignment and to reconstruct the divided pieces into the original secret are proposed.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126246033","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
Allocation time-based processor allocation scheme for 2D mesh architecture 基于时间的二维网格结构处理器分配方案
Xiaomei Zhu, Wei-Ming Lin
The mesh is a widely used architecture in parallel computing systems. Research on efficient allocation of processors to incoming tasks on a mesh architecture is very important in achieving the desired high performance. The processor allocation strategy proposed in this paper is based on a well-known boundary search approach by considering allocation time similarity as another primary allocation decision-making factor. In this proposed technique, an additional novel heuristic is employed to consider allocating tasks with similar allocation times with submeshes adjacent to each other, whenever feasible. The external fragmentation problem is expected to be alleviated, which leads to improvement in, better utilization and shorter task waiting time. Our simulation results demonstrate a substantial improvement.
网格是并行计算系统中广泛使用的一种体系结构。研究如何在网格结构中有效地分配处理器来处理传入任务,对于实现理想的高性能是非常重要的。本文提出的处理器分配策略基于一种著名的边界搜索方法,将分配时间相似度作为另一个主要的分配决策因素。在该技术中,在可行的情况下,采用了一种新的启发式方法来考虑分配具有相似分配时间且子网格彼此相邻的任务。外部碎片化问题有望得到缓解,从而提高利用率,缩短任务等待时间。我们的仿真结果显示了显著的改进。
{"title":"Allocation time-based processor allocation scheme for 2D mesh architecture","authors":"Xiaomei Zhu, Wei-Ming Lin","doi":"10.1109/ICPADS.1998.741114","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741114","url":null,"abstract":"The mesh is a widely used architecture in parallel computing systems. Research on efficient allocation of processors to incoming tasks on a mesh architecture is very important in achieving the desired high performance. The processor allocation strategy proposed in this paper is based on a well-known boundary search approach by considering allocation time similarity as another primary allocation decision-making factor. In this proposed technique, an additional novel heuristic is employed to consider allocating tasks with similar allocation times with submeshes adjacent to each other, whenever feasible. The external fragmentation problem is expected to be alleviated, which leads to improvement in, better utilization and shorter task waiting time. Our simulation results demonstrate a substantial improvement.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124697908","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
期刊
Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1