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

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming最新文献

筛选
英文 中文
vStarCloud: A New Network Computing Operating System for Multicore and Clouds vStarCloud:面向多核和云的新型网络计算操作系统
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.40
Zuoning Chen, Hongwu Yin, Lufei Zhang, Xingyan Wang, Sheng He, Jianwei Yin
{"title":"vStarCloud: A New Network Computing Operating System for Multicore and Clouds","authors":"Zuoning Chen, Hongwu Yin, Lufei Zhang, Xingyan Wang, Sheng He, Jianwei Yin","doi":"10.1109/PAAP.2011.40","DOIUrl":"https://doi.org/10.1109/PAAP.2011.40","url":null,"abstract":"Recently, cloud computing becomes the new direction of future network computing. The traditional operating system cannot support heterogeneous multicore platforms, and cannot meet the requirements of cloud computing application well. So developing a new network computing operating system for multicore and clouds is extremely important. This paper analyzes the deficiencies of traditional operating system, and figures out the challenges that the new network computing operating systems face. After describing the design principles, we propose the prototype architecture of vStarCloud.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117334269","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
Estimation of BSP Network Parameters Based on MPI-2 One-Sided Operation 基于MPI-2单侧运算的BSP网络参数估计
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.66
Huan Zhou, Qi-long Zheng, Rui Wang
{"title":"Estimation of BSP Network Parameters Based on MPI-2 One-Sided Operation","authors":"Huan Zhou, Qi-long Zheng, Rui Wang","doi":"10.1109/PAAP.2011.66","DOIUrl":"https://doi.org/10.1109/PAAP.2011.66","url":null,"abstract":"The BSP network parameters are usually measured by one-sided communication functions in BSPlib standard, which can't reflect the communication performance of the message passing parallel machines effectively. Furthermore, the one-sided operation is becoming more and more popular with high-performance communication as the release of MPI-2 version. This paper further investigates the implementation of MPI-2 one-sided operation, and proposes a new estimation scheme that using the one-sided operation for BSP network parameters g and L, they are measured on the DOWNING 4000A Cluster machine under the condition of different number of processes which adopts the all-to-all total change communication mode. And it validates the correctness and the validity of the MPI program cost analysis, which makes use of the BSP model and a parallel radix-2 FFT algorithm based on the BSP model. The results prove that the new estimation scheme is effective and practical for the DOWNING Cluster machine and other similar message passing parallel machines.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122688880","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
Eigen Feature Extraction by Image Locality Preservation 基于图像局部保持的特征提取
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.22
X. Han, Yun Liu, Fei Xia, Hongjie Zhang
{"title":"Eigen Feature Extraction by Image Locality Preservation","authors":"X. Han, Yun Liu, Fei Xia, Hongjie Zhang","doi":"10.1109/PAAP.2011.22","DOIUrl":"https://doi.org/10.1109/PAAP.2011.22","url":null,"abstract":"Pattern recognition is one of the most popular topics in the world today. One of its problems is reducing sample variation for the same class and keeping discrimination for different classes. Principal component analysis (PCA) is a multivariate technique that analyzes a data table in which observations are described by several inter-correlated quantitative dependent variables. Its goal is to extract important information from the table to represent it as a set of new orthogonal variables called principal components. Mathematically, PCA depends on the Eigen-decomposition of positive semi-demote matrices and upon the singular value decomposition (SVD) of rectangular matrices. To produce more reliable eigenvalues and hence boost classification accuracy, this project constructs a novel covariance matrix that preserves image locality. The result of this project is significant. The training data can predict testing data accuracy. Compared to with covariance used before, this new covariance may better reflect the relationship between pixels of an image better, hence, classification is better.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122596406","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
Scalable Seed Expansion for Identifying Web Communities 用于识别Web社区的可扩展种子扩展
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.64
Min Han, Hong Shen, Xianchao Zhang
{"title":"Scalable Seed Expansion for Identifying Web Communities","authors":"Min Han, Hong Shen, Xianchao Zhang","doi":"10.1109/PAAP.2011.64","DOIUrl":"https://doi.org/10.1109/PAAP.2011.64","url":null,"abstract":"We study the problem of identifying Web communities around some seed vertex. In this work, we propose a fast graph algorithm to expand Web communities in a scalable style. Given a seed vertex, our algorithm computes approximate personalized PageRank vectors with better and better approximations, and finds the smallest conductance sets on these vectors as candidate communities in nearly-linear time. At the end, it returns the candidate community with the smallest conductance as the result community. We also define local community profile (LCP) to investigate structural and statistical properties of Web communities in a local range. Theoretical analysis and primary experiments both show the efficiency of the proposed algorithm and the quality of the results.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123170760","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 Parallel Computing Procedure for the Lower and Upper Bounds on the Functionals of Solutions to PDE: Application to the J-Integral in Functionally Graded Materials PDE解泛函下界和上界的并行计算方法:在功能梯度材料j积分中的应用
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.48
Z. Xuan
{"title":"A Parallel Computing Procedure for the Lower and Upper Bounds on the Functionals of Solutions to PDE: Application to the J-Integral in Functionally Graded Materials","authors":"Z. Xuan","doi":"10.1109/PAAP.2011.48","DOIUrl":"https://doi.org/10.1109/PAAP.2011.48","url":null,"abstract":"A parallel computing procedure for computing the bounds on the {it J}-integral in functionally graded materials is presented based on a Neumann element a-posteriori error bound. The finite element solution of {it J}-integral is first obtained on a coarser finite element mesh, then a-posteriori bounding procedure based on the finite element error estimate is used to compute the lower and upper bounds on the {it J}-integral. The computation of the error estimate is performed by solving independent elemental Neumann sub problems decomposed from the finite element model, thus the computing procedure is parallel and potential to solve large scale structural problems. An example is given in the end of paper to compute the lower and upper bounds on the {it J}-integral of functionally graded materials.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131641979","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
The Design and Implementation of OMPit: An OpenMP Compiler Characterized by Logs for Parallel and Work-Sharing 以日志为特征的OpenMP并行和工作共享编译器OMPit的设计与实现
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.55
Qiuming Luo, Ye Cai, Chengjian Liu, Chang Kong
{"title":"The Design and Implementation of OMPit: An OpenMP Compiler Characterized by Logs for Parallel and Work-Sharing","authors":"Qiuming Luo, Ye Cai, Chengjian Liu, Chang Kong","doi":"10.1109/PAAP.2011.55","DOIUrl":"https://doi.org/10.1109/PAAP.2011.55","url":null,"abstract":"There are many tools for OpenMP benchmarking which measure the various aspects of the performance, such as the overheads of OpenMP directives and the characteristics of the whole system. But we lack some tools to show us the worksharing details when the OpenMP program finished running. The OMPit (OMPi for tutoring) is designed to provide the worksharing information during the running, which can be used for tutoring and might help debugging or tuning. The work-sharing logging includes the work assignment and the timestamps for three different work-sharing behaviors. The logging information can be output as a text files or visualized figures. The designing of OMPit is provided and the details of how to inserting the logging code into the OMPi compiler is discussed too.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131861438","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}
引用次数: 1
A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph 图和超图的Max-k-Cut局部搜索逼近算法
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.35
Wen-xing Zhu, Chuanyin Guo
{"title":"A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph","authors":"Wen-xing Zhu, Chuanyin Guo","doi":"10.1109/PAAP.2011.35","DOIUrl":"https://doi.org/10.1109/PAAP.2011.35","url":null,"abstract":"Given a graph or hyper graph, the graph or hyper graph Max-k-Cut problem is to partition the vertices into k nonempty sets such that the sum of weights of edges across different sets is maximized. We present a deterministic local search algorithm for the problem, which has a performance ratio 1 - 1/k for Max-k-Cut of graph, and has a similar result for Max-k-Cut of hyper graph.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669430","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}
引用次数: 6
Using User-Level Virtualization in Desktop Grid Clients for Application Delivery and Sandboxing 在桌面网格客户端中使用用户级虚拟化进行应用程序交付和沙箱
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.44
Youhui Zhang, Yanhua Li, Weimin Zheng
{"title":"Using User-Level Virtualization in Desktop Grid Clients for Application Delivery and Sandboxing","authors":"Youhui Zhang, Yanhua Li, Weimin Zheng","doi":"10.1109/PAAP.2011.44","DOIUrl":"https://doi.org/10.1109/PAAP.2011.44","url":null,"abstract":"Desktop grid is a form of distributed computing that harvests the computing power of idle desktop computers whether these are volunteers or deployed at an institution. This paper proposes to design and implement a client-end framework of desktop grid, based on cloud storage, which can also deliver legacy applications on-demand to volunteer machines. From technical viewpoint, an isolated execution environment based on user-level virtualization will be achieved: on one side, some resource-accessing APIs for applications are intercepted and redirected to real storage positions (on the cloud); therefore legacy applications can run without installation to simplify maintenance. On the other side, this mechanism can also construct a sandbox to restrict the access range of applications for security. This proposal adopts promising cloud-related technologies for requirements of volunteer computing, tests show that it only causes limited performance loss.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115063108","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 Model Design and Simulation of Automatic Placement Path for the Shell of Composite Materials 复合材料壳体自动放置路径的模型设计与仿真
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.43
Xiaodan Liang
{"title":"The Model Design and Simulation of Automatic Placement Path for the Shell of Composite Materials","authors":"Xiaodan Liang","doi":"10.1109/PAAP.2011.43","DOIUrl":"https://doi.org/10.1109/PAAP.2011.43","url":null,"abstract":"Composite materials are new types of heterogeneous solid materials, which are characteristic of high strength, high stiffness, corrosion-resistant and structural stable and ease molding, etc. Automatic placement technology is an advanced molding technology for composite materials developed in recent decades. In this paper, we proposed a new placement method, which is appropriate for conical shell with small conicity. The corresponding model of placement path was established, and the placement process was simulated using three-dimensional software. The results verified that the longitudinal placement process is feasible for manufacturing process of high-performance composite materials.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994216","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}
引用次数: 1
Active Semi-supervised Spectral Clustering 主动半监督光谱聚类
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-01 DOI: 10.1109/PAAP.2011.61
Xinyue Liu, Linlin Zong, Xianchao Zhang, Hongfei Lin
{"title":"Active Semi-supervised Spectral Clustering","authors":"Xinyue Liu, Linlin Zong, Xianchao Zhang, Hongfei Lin","doi":"10.1109/PAAP.2011.61","DOIUrl":"https://doi.org/10.1109/PAAP.2011.61","url":null,"abstract":"Spectral clustering is widely used in these years. Recently, methods that connect spectral clustering and semi-supervised clustering become popular. These methods improve the result through using constraint information in spectral clustering. Generally, there are two ways to select constrained information, one is random selection method and the other is active learning method. Here we focus on active learning methods. In this paper, we propose an active learning process, which considers the local and global information of dataset, and decide which constraint to choose by studying the change of eigenvectors.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012323","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
首页 上一页 下一页 尾页
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学术官方微信