检索结果-内蒙古大学图书馆

3rd International Symposium on parallel and distributed Processing and Applications, ISPA 2005

作者： Yang, Chao-Tung Shih, Po-Chi Lin, Cheng-Fang Hsu, Ching-Hsien Li, Kuan-Ching High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan

ISBN: (纸本)3540297693

In order to identify and schedule jobs that are suitable for determined resources, an execution time estimation model is required. In this paper, it is described a Chronological history-based execution time estimation model to predict current execution time, according to the previous execution results. We built a heterogeneous computational Grid environment using Globus Toolkit, and our research is focused in Grid computing environments and to execute parallel jobs on multiple resources by measuring its accuracy. The experimental results shown that our model can accurately predict the execution time of embarrassingly parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Visuel: A novel performance monitoring and analysis toolkit for cluster and grid environments

引用

6th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP

作者： Li, Kuan-Ching Cheng, Hsiang-Yao Yang, Chao-Tung Hsu, Ching-Hsien Wang, Hsiao-Hsi Hsu, Chia-Wen Hung, Sheng-Shiang Chang, Chia-Fu Liu, Chun-Chieh Pan, Yu-Hwa Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (纸本)3540292357

The computing power provided by high performance low-cost PC-based Cluster and Grid platforms are attractive, and they are equal or superior to supercomputers and mainframes widely available. In this research paper, we present the design rationale and implementation of Visuel, a toolkit for performance measurement and analysis of MPI parallel programs and real time resources monitoring in cluster and grid computing environments. The proposed toolkit is web-based interface to show performance activities of all computing nodes involved in the execution of a MPI parallel program, such as CPU and memory usage levels of each computing node, and monitors all computing nodes of a computing platform by displaying real time performance data. In addition, this toolkit is able to display comparative performance data charts of multiple executions of MPI parallel application under investigation, which facilitates the "what-if" analysis. The usage of this toolkit shows that it outperforms in easing the process of investigation of parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel loop self-scheduling on grid environments

引用

IFIP International Conference on Network and parallel computing, NPC 2004

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540233881

The approaches to deal with scheduling and load balancing on PC-based cluster systems are famous and well-known. Self-scheduling schemes, which are suitable for parallel loops with independent iterations on cluster computer system, they have been designed in the past. In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PC-based cluster and grid computing environments in order to improve system performance. A grid computing environment consists of multiple PC-based clusters is constructed using Globus Toolkit and SUN Grid Engine middleware. The experimental results show that our scheduling can result in higher performance than other similar schemes. © IFIP International Federation for Information Processing 2004.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT SPECTRAL METHODS FOR EIGENVALUE PROBLEMS OF THE INTEGRAL FRACTIONAL LAPLACIAN ONABALLOFANYDIMENSION

引用

Journal of Computational Mathematics 2024年第4期42卷 1032-1062页

作者： Suna Ma Huiyuan Li Zhimin Zhang Hu Chen Lizhen Chen College of Science Nanjing University of Posts and TelecommunicationsNanjingChina State Key Laboratory of Computer Science/Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijingChina Department of Mathematics Wayne State UniversityDetroitUSA School of Mathematical Sciences Ocean University of ChinaQingdaoChina Beijing Computational Science Research Center BeijingChina

An efficient spectral-Galerkin method for eigenvalue problems of the integral fractional Laplacian on a unit ball of any dimension is proposed in this *** symmetric positive definite linear system is retained explicitly which plays an important role in the numerical *** a sharp estimate on the algebraic system's condition number is established which behaves as N4s with respect to the polynomial degree N,where 2s is the fractional derivative *** regularity estimate of solutions to source problems of the fractional Laplacian in arbitrary dimensions is firstly investigated in weighted Sobolev *** the regularity of eigenfunctions of the fractional Laplacian eigenvalue problem is readily ***,rigorous error estimates of the eigenvalues and eigenvectors are *** experiments are presented to demonstrate the accuracy and efficiency and to validate the theoretical results.

关键词： Integral fractional Laplacian Spectral method Eigenvalue problem Regularity analysis Error estimate

来源：评论

学校读者我要写书评

暂无评论

Efficient mobile code offloading in heterogeneous wireless networks

Efficient mobile code offloading in heterogeneous wireless n...

引用

作者： Lu, Feng Liu, Ruoxue Li, Wei Jin, Hai Zomaya, Albert Y. Services Computing Technology and System Lab Big Data Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Center for Distributed and High Performance Computing School of Information Technologies The University of Sydney Sydney Australia

Mobile data offloading has already appeared to offer the means of addressing the challenges of limited computing capability and battery life of mobile devices. Most existing code offloading frameworks only consider migrating an application within a single network at a time and failed to fully utilize the energy efficiency mechanism of the latest CPU chips. To tackle these issues, we propose an offloading approach under both a multitasking environment and a heterogeneous network to increase energy and execution efficiency. The offloading problem was formulated as a biobjective optimization problem that aims to save energy and keep a good performance by combining mobile cloud computing with *** technology under a heterogeneous network equipped with cellular and WiFi connectivity. By varying the applications and network scenarios, the experimental results show that with offloading a single application using our proposed framework, the data-intensive application can obviously benefit when the access point density of WiFi reaches 0.0002 unit/m2. Under multiple application scenarios, our proposed framework can increase processing speed by an average of 0.3× over the single application and can save an average of 25% power over the single application. © 2019 John Wiley & Sons, Ltd.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Cost-optimal parallel algorithms for finitely inductive sequences

Cost-optimal parallel algorithms for finitely inductive sequ...

引用

Annual Hawaii International Conference on System sciences (HICSS)

作者： S.K. Das P.S. Fisher H. Zhang Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX USA

Finitely inductive (FI) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. The authors propose cost-optimal parallel algorithms for FI sequence processing. These algorithms include parallel factoring and following by bucket packing and by hashing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. Each of the algorithms achieves cost-optimal speedup under certain conditions as detailed.< >

关键词： parallel algorithms Pattern recognition Pattern matching distributed computing computer science Impedance matching Phase change random access memory Multiple signal classification Signal detection Motion detection

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing strategies for conservative parallel simulations

Dynamic load balancing strategies for conservative parallel ...

引用

Workshop on Principles of Advanced and distributed Simulation (PADS)

作者： A. Boukerche S.K. Das Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX USA

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra (1979) null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each processor. We examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because its many cycles aid in the formation of deadlock, making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.

关键词： Load management Computational modeling Protocols distributed computing Stress Testing Partitioning algorithms Discrete event simulation computer simulation Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Cost-optimal parallel algorithms for traversing trees

Cost-optimal parallel algorithms for traversing trees

引用

IEEE Southeastcon

作者： S.K. Das C.C.-Y. Chen Center of Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX USA

The authors present cost-optimal parallel algorithms for depth-order (e.g., pre-, in-, and post-order) and level-order (e.g., breadth-first and breadth-depth) traversals of general trees with n nodes. Each of the algo... 详细信息

关键词： parallel algorithms Phase change random access memory computer science Binary trees distributed computing Classification tree analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A credit-payment scheme for packet forwarding fairness in mobile ad hoc networks

A credit-payment scheme for packet forwarding fairness in mo...

引用

2005 IEEE International Conference on Communications, ICC 2005

作者： Yoo, Younghwan Ahn, Sanghyun Agrawal, Dharma P. OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH 45221-0030 School of Computer Science University of Seoul Seoul 130-743 Korea Republic of

Routing protocols for mobile ad hoc networks (MANETs) have assumed that all nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all nodes in previous MANETs belonged to a single authority. In the near future, however, a MANET may consist of nodes that belong to multiple organizations since various civilian applications are expected to appear. In this situation, mobile nodes may deliberately avoid packet forwarding to save their own energy, resulting in network partition. To make nodes volunteer in packet forwarding we suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIFA). In this type of schemes, nodes need credits to transmit their own packets, and this credit can be earned by forwarding others' packets. PIFA can be utilized irrespective of the type of basic routing protocols, while previous methods are compatible only with source routing like DSR. Simulation results show that PIFA can prevent network partition and network performance degradation due to selfish nodes by inducing them to participate in forwarding packets. © 2005 IEEE.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

parallel macro pipelining on the intel SCC many-core computer

Parallel macro pipelining on the intel SCC many-core compute...

引用

2013 IEEE 37th Annual computer Software and Applications Conference, COMPSAC 2013

作者： Suss, Tim Schoenrock, Andrew Meisner, Sebastian Plessl, Christian Johannes Gutenberg-University Mainz Zentrum fur Datenverarbeitung Mainz Germany Carleton University School of Computer Science Ottawa Canada University of Paderborn Paderborn Center for Parallel Computing Paderborn Germany

ISBN: (纸本)9780769549798

In this paper we present how Intel's Single-Chip-Cloud processor behaves for parallel macro pipeline applications. Subsets of the SCC's available cores can be arranged as a pipeline where each core processes one stage of the overall workload. Each of the independent cores processes a small part of a larger task and feeds the following core with new data after it finishes its work. Our case-study is a parallel rendering system which renders successive images and applies different filters on them. On normal graphics adapters this is usually done in multiple cycles, we do this in a single pipeline pass. We show that we can achieve a significant speedup by using multiple parallel pipelines on the SCC. We show that we can further improve performance by using SCC's controlling PC in conjunction with the SCC. We also identify aspects of the SCC that hinder the overall performance, mainly the lack of local memory banks for each core on the SCC. The results presented in this paper are not limited to only image processing, but users could expect similar experiences where macro pipelining is used in other applications on the SCC. © 2013 IEEE.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：