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

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： thiare, Ousmane Naimi, Mohamed Department of Computer Science LICP EA2175 University of Cergy-Pontoise France

ISBN: (纸本)9781604236446

Group mutual exclusion is a naturel problem, formulated by Joung, that generalize the classical mutual exclusion problem. In group mutual exclusion a process requests a"session" before entering its critical section;processes are allowed to be in the critical section simultaneously provides they have requested the same session. We propose in this paper a quorum-based algorithm for group mutual exclusion. this algorithm assumes that only one session can be opened at any time, several process can access to the same session, and any requested session can be opened in a finite time. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reliable Scheduling of Stochastic Tasks in Heterogeneous distributed computing systems 19

Reliable Scheduling of Stochastic Tasks in Heterogeneous Dis...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Maksoud, Ehab Abdel Ammar, Reda A. Faculty of Engineering Cairo University Egypt Computer Science and Engineering Department University of Connecticut United States

ISBN: (纸本)9781604236446

High performance and reliability are critical requirements for real time systems. Efficient scheduling that assigns tasks of an application to suitable processors in these systems is necessary for achieving high performance. In a previous work, we developed a heuristic algorithm for scheduling a set of independent stochastic tasks in a homogeneous multiprocessor system, to yield the maximum probability for each task to meet its deadline. In this paper, we extend this work to schedule tasks in heterogeneous computing environments. We also present an efficient reliable simple heuristic algorithm to distribute tasks among available processors to maximize simultaneously both of the reliability of the application and the performance measures, such as the success ratio and processor utilization. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm for the Genetic KNN-Impute Algorithm 19

Parallel Algorithm for the Genetic KNN-Impute Algorithm

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Rekapalli, Bhanu Peterson, Gregory Rose, John Hillhouse, Bob Department of Electrical & Computer Engineering The University of Tennessee KnoxvilleTN37996 United States Web Services Group The University of Tennessee KnoxvilleTN37996 United States

ISBN: (纸本)9781604236446

Microarray experiments generate a plethora of genomic data;therefore, we need techniques and architectures to analyze this data more quickly. the paper presents a solution for reducing the computation time of one of the highly computationally intensive data analysis parts of a Stanford Microarray Database (SMD) application. the paper describes the computationally intensive K-Nearest Neighbors (KNN) imputation algorithm used in SMD. Performance of the parallel implementation scales well for larger problem sizes. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Designing parallel Algorithms on the Star Graph Using Orthogonal Decomposition 19

Designing Parallel Algorithms on the Star Graph Using Orthog...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Qiu, Ke Department of Computer Science Brock University St. CatharinesON Canada

ISBN: (纸本)9781604236446

the star graph is an attractive alternative to the hypercube for interconnecting processors in a parallel computer. Since its proposal, many parallel algorithms have been designed to run on this topology. However, most of them (if not all) use the standard scheme that decomposes an n-star into (n - 1)-stars when recursion is involved. Another way of partitioning an n-star is the so-called orthogonal partition, first observed in the original paper that proposed the graph. As noted by some researchers in this area, this important property is overlooked by subsequent work on star graphs. In this paper, we present two parallel algorithms that utilize this orthogonal partition. the running times of both algorithms are optimal and match those of previous algorithms obtained using the standard decomposition scheme, thus demonstrating the usefulness of the orthogonal partition. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED PROCESSOR ALLOCATION SCHEME for MIXED parallel TASK GRAPHS 19

AN IMPROVED PROCESSOR ALLOCATION SCHEME for MIXED PARALLEL T...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Bansal, Savina Kumar, Padam Singh, Kuldip Deptt of ECE GZSCET Bathinda India Deptt of E &CE IIT Roorkee India

ISBN: (纸本)9781604236446

A two-step Modified Critical Path and Area-based (MCPA) scheduling heuristic is developed which targets at improving the processor allocation phase of an existing Critical Path and Area-based (CPA) scheduling algorithm. Strength of the suggested algorithm lies in bridging the gap between the processor allocation and task assignment phases of scheduling. Performance of the suggested algorithm, as evaluated for random and real application task graph suite, is better than the CPA algorithm and comparable to more complex CPR algorithm. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT WORKLOAD ALLOCATION TO SCHEDULE TANDEM REAL-TIME TASK GRAPHS IN A CLUSTER computing ENVIRONMENT 19

EFFICIENT WORKLOAD ALLOCATION TO SCHEDULE TANDEM REAL-TIME T...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Hussein, Ahmed Ammar, Reda Hamdy, Abeer University of Connecticut StorrsCT06269 United States Electronic Research Institute Giza Egypt

ISBN: (纸本)9781604236446

Scheduling real-time tasks in multiprocessor systems is one of the most challenging problems in parallel and distributed computing. this paper presents a heuristic algorithm to schedule real-time applications represented by tandem task graphs in cluster platforms. the proposed algorithm produces schedules that improve acceptance rate of the applications by efficiently utilizing the processing power of the cluster's processors. Moreover, our algorithm employs a multi-objective function that attempts to optimize different performance criteria, namely processing power fragmentation, context switching, and communication cost among processors. Optimizing these criteria results in a better utilization of processing power and consequently improves acceptance rate. Experimental results revealed that our algorithm considerably outperforms traditional algorithms. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Real-Time Wireless Control and Data Acquisition Via an Embedded System 19

Real-Time Wireless Control and Data Acquisition Via an Embed...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Bachnak, Rafic Mendez, Marc Esparza, Jack Fahed, Oliver Department of Computing and Math Sciences Texas A&M University - Corpus Christi United States

ISBN: (纸本)9781604236446

Data collection in shallow water areas presents several challenges to the scientist. Obstacles that are encountered in such environments include difficulty in covering large territories and the presence of inaccessible areas due to a variety of reasons, such as soft bottoms or contamination. this paper describes the development of a remotely operated boat in shallow water environments. the operation is accomplished in real-time through an embedded system that employs real-time wireless control and data acquisition capabilities. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

A PC-based parallel Programming System 19

A PC-based Parallel Programming System

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Wang, Baoying Gong, Qi Hu, Jie Waynesburg College WaynesburgPA15370 United States St. Cloud State University St. CloudMN56301 United States

ISBN: (纸本)9781604236446

parallel computing is primarily used in supercomputer environment with many available application tools. Since the early 1990s, there has been an increasing trend to move away from expensive and specialized parallel supercomputers towards networks of workstations (NOW) because of their low cost and lost risk. However, there is still a lack of tools for developing and running parallel applications on a NOW environment. this paper presents an object-oriented, parallel programming system using a network of PCs on a LAN (local area network). Our goal is to provide a cost-effective, easy to use, and fault tolerant system with a "single image". the system tests show that our primary goals have been achieved. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

DR3DH: A DoS resistant extended triple Diffie–Hellman for mobile edge networks

引用

Computer Networks 2025年 265卷

作者： Altaweel, Ala Bouridane, Ahmed Department of Computer Engineering College of Computing and Informatics University of Sharjah Sharjah United Arab Emirates

Mobile Edge Networks (MENs) are wireless networks that establish "close-to-end-users-clouds" to provide storage, computation, and communication services. MENs employ the Extended Triple Diffie–Hellman (X3DH) protocol to establish secret keys that provide end-to-end encryption among their nodes. X3DH relies on a cloud server that stores the public keys of the nodes to address the asynchronous scenarios when they operate offline. the cloud server in X3DH protocol represents a single point of failure (SPoF), as the exchange of secure keys is disrupted if the server fails or is compromised. Moreover, a malicious attacker, Eve, can launch various DoS attacks against the MEN nodes (e.g., packet dropping or packet modification) and wireless links (e.g., jamming) to disrupt the execution of X3DH during secure key exchange. this paper proposes the DoS-Resistant-X3DH (DR3DH) protocol to resolve the SPoF of the cloud server in X3DH and to address packet dropping, packet modification, and jamming DoS attacks. DR3DH employs Reed–Solomon Erasure Coding to encode the X3DH public keys into fragments that are distributed into a set of storage nodes. these storage nodes, which are determined by an Integer Linear Programming (ILP) solver, are optimum. that is, they have lowest probabilities to launch packet dropping/modification attacks and lowest probabilities that the wireless links toward them are jammed. the authors evaluated DR3DH through trace-driven simulations in MATLAB using two mobility traces and a proof-of-concept implementation in Java. the authors also compared DR3DH with two approaches that employ Random and Greedy policies when selecting the storage nodes for keys fragments. the results demonstrate the resistance of DR3DH to DoS attacks, achieving a high success rate that outperforms the Random and Greedy approaches by between 13.6% and 83.0%. Additionally, the results confirm the feasibility of DR3DH under different mobility models and node speeds, as demonstrated by

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Coarse-Grained parallel Particle Swarm Optimization 19

Performance Analysis of Coarse-Grained Parallel Particle Swa...

引用

19th international conference on parallel and distributed computing systems, pdcs 2006

作者： Gurumani, Swathi T. Noel, Mathew M. Wells, B. Earl Jannett, thomas C. Electrical and Computer Engineering Department University of Alabama in Huntsville HuntsvilleAL35899 United States Electrical and Computer Engineering Department University of Alabama at Birmingham BirminghamAL35294 United States

ISBN: (纸本)9781604236446

Particle Swarm Optimization (PSO) is an evolutionary population based stochastic optimization technique that has been successfully applied to a wide range of NP complete optimization problems. the classical PSO algorithm uses the global best solution to update each particle and this contributes to higher communication overhead in parallel implementations. Many coarse-grained parallelization approaches have been presented to overcome this limitation. this paper presents an empirically verifiable analytical performance model that predicts the run-time behavior of one such coarse-grained parallel algorithm. the purpose of this model is to aid in the selection of appropriate parameter values to achieve good performance metrics. Results from the parallel implementation of this coarse-grained approach have also been presented to validate the performance model. © 19th international conference on parallel and distributed computing systems 2006, pdcs 2006. All rights reserved.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：