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

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2017

作者： Gao, Yongqiang Wei, Hengchao College of Computer Science Inner Mongolia University Hohhot China

ISBN: (纸本)9781538631515

With the rising demand on internet online services, more and more individuals and organizations migrate their data and services from local to geographically distributed internet data centers for reliability, management, and cost benefits. From internet data center operators' perspective, profit is one of the most significant factors which are to be taken into account and it is mainly determined by the quality of service and the electricity cost. In this work, we jointly take the diversity of time-varying electricity prices, the quality of service and the power usage effectiveness of data centers into consideration and propose a profit optimization framework that includes three important decisions: requests dispatching, the number of active servers and frequency adjustment. An efficient heuristic algorithm is then developed to provide internet data center operators with the advice on these decisions to achieve profit maximization for geographically distributed data centers. through extensive trace-driven simulations, we demonstrate the effectiveness and superiority of our solution. © 2017 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

引用

JOURNAL OF parallel AND distributed computing 2007年第7期67卷 797-815页

作者： Mittal, Neeraj Mohan, Prajwal K. Univ Texas Dept Comp Sci Richardson TX 75083 USA Intel Corp Digital Home Grp Hillsboro OR 97124 USA

In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. this is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are nonuniformly distributed. Our algorithm has a message complexity of 2n - 1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. the maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases. (C) 2007 Elsevier Inc. All rights reserved.

关键词： message-passing system resource management group mutual exclusion token-based algorithm non-uniform group selection priority-based scheme

来源：评论

学校读者我要写书评

暂无评论

Secure Coded Computation for Efficient distributed Learning in Mobile IoT 18

Secure Coded Computation for Efficient Distributed Learning ...

引用

18th Annual IEEE international conference on Sensing, Communication, and Networking (SECON)

作者： Yang, Yilin D'Oliveira, Rafael G. L. El Rouayheb, Salim Yang, Xin Seferoglu, Hulya Chen, Yingying Rutgers State Univ New Brunswick NJ 08854 USA MIT Cambridge MA 02139 USA Univ Illinois Chicago IL USA

ISBN: (纸本)9781665441087

distributed computation plays an essential role in cloud and edge computing. Data such as images, audio, and text can be represented as matrices to facilitate efficient computation, especially in the domains of distributed machine learning, computer vision, and signal processing. Many coded computation algorithms have been proposed for big data applications to securely partition and distribute matrices to parallel worker devices. However, these proposals have yet to he adapted for mobile platforms beyond theoretical means. Mobile IoT networks can greatly benefit from secure distributed computing, however, commercial devices such as smartphones and tablets are much more limited in resources compared to platforms in data centers, requiring special design considerations. We investigate existing distribution schemes from an operational complexity and security viewpoint and study their perlbrmance in several mobile IoT networks, identifying performance bottlenecks in regards to communication and computation costs. From our findings, we propose new, scalable algorithms optimized to handle the unique constraints of mobile loT. Extensive evaluations of our proposals on publicly available image classification datasets show how distributed learning can be specially optimized to enhance runtime and battery performance on mobile loT by over 10x.

关键词： distributed computing coded computations edge device mobile IoT

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2020 IEEE international Symposium on parallel and distributed Processing with Applications, 2020 IEEE international conference on Big Data and Cloud computing, 2020 IEEE international Symposium on Social computing and Networking and 2020 IEEE international conference on Sustainable computing and Communications, ISPA-BDCloud-SocialCom-SustainCom 2020

Proceedings - 2020 IEEE International Symposium on Parallel ...

引用

18th IEEE international Symposium on parallel and distributed Processing with Applications, 10th IEEE international conference on Big Data and Cloud computing, 13th IEEE international Symposium on Social computing and Networking and 10th IEEE international conference on Sustainable computing and Communications, ISPA-BDCloud-SocialCom-SustainCom 2020

ISBN: (纸本)9781665414852

the proceedings contain 202 papers. the topics discussed include: multi-relational graph convolutional networks for skeleton-based action recognition;identifying the right person in social networks with double metaphone codes;a novel strong cache consistency mechanism in ICN based on role division and lease model;demystifying the largest live game streaming platform via black-box measurement;framework-agnostic optimization of repeated skewed joins at massive scale;remote procedure call optimization of big data systems based on data awareness;MCSEC: secure coded matrix multiplication scheme for edge computing with minimum communication cost;low-rate DoS attack detection based on WPD-EE algorithm;user identity linkage across location-based social networks with spatio-temporal check-in patterns;optimizing 3-D placement of multiple UAVs based on Taguchiâ€™s method;and feature envy detection based on Bi-LSTM with self-attention mechanism.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Task Graphs Scheduling Based on the Internal Structure 18th

Parallel Task Graphs Scheduling Based on the Internal Struct...

引用

18th Mexican international conference on Artificial Intelligence (MICAI)

作者： Velarde Martinez, Apolinar Inst Tecnol El Llano Aguascalientes Carretera Aguascalientes San Luis Potosi Km 18 Aguascalientes Aguascalientes Mexico

ISBN: (纸本)9783030337490;9783030337483

It is well known that parallel Task Graphs (PTG) are modeled with Directed Acyclic Graphs (DAG Tasks). DAG tasks are scheduled in Heterogeneous distributed computing systems (HDCS) for execution with different techniques which seek to reduce completion of each PTG. Proposed planning techniques generally only make use of the critical path in planning as an internal characteristic of the DAG Task, helping to optimize scheduling. In this study it is shown that analyzing other internal characteristics, such as layering and graph density aside from the critical path of DAG workflow tasks, before being scheduled in execution locations, can improve computer system performance, as well as optimize the use of their resources. For the above, the internal characteristics considered in this study of each DAG task are: the critical path, layering as well as graph density. the analyzed DAG tasks are synthetic loads produced with a graph generation algorithm as well as real application graphs. the findings obtained with the experiments performed show that the distribution estimation algorithm obtains better response times than the genetic algorithm.

关键词： Directed Acyclic Graph parallel Task Graphs Heterogeneous distributed computing systems

来源：评论

学校读者我要写书评

暂无评论

Two-Level Result Caching for Web Search Queries on Structured P2P Networks

Two-Level Result Caching for Web Search Queries on Structure...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Rosas, Erika Hidalgo, Nicolas Marin, Mauricio Yahoo Labs Santiago Santiago Chile

ISBN: (纸本)9781467345651;9780769549033

this paper proposes a two-level caching strategy for Web search queries which is devised to operate on P2P networks. the aim is to significantly reduce query traffic going from a large community of users to commercial search engines by placing between them a P2P caching service capable of storing and efficiently distributing frequent queries among users. the proposed design takes into consideration the highly dynamic nature of user queries both in traffic intensity and drastic shifts in user interest which are both usually driven by unpredictable world-wide events. Each peer maintains a LRU result cache (RCache) used to keep the answers for queries originated in the peer itself and queries for which the peer is responsible for by contacting on-demand a Web search engine to get the query answers. When query traffic is predominantly routed to a few responsible peers our strategy replicates the role of "being responsible for" to neighboring peers so that they can absorb part of the traffic to restore load balance. this is a fairly slow and adaptive process that we call mid-term load balancing. To achieve a short-term fair distribution of queries we introduce in each peer a location cache (LCache) which keeps pointers to peers that have already requested the same queries in the very recent past. this lets these peers share their query answers with newly requesting peers. this process is fast as these popular queries are usually cached in the first DHT hop of a requesting peer which quickly tends to redistribute load among more and more peers. A comparative study shows that the proposed strategy achieves better load balance, significantly smaller communication volume among peers, and larger cache hit ratios than previous strategies.

关键词： Web Search Engines Caching Services Load Balancing P2P networks distributed Hash Tables

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 9th iasted international conference on Artificial Intelligence and Soft computing, ASC 2005

Proceedings of the 9th IASTED International Conference on Ar...

引用

9th iasted international conference on Artificial Intelligence and Soft computing, ASC 2005

ISBN: (纸本)0889865361

the proceedings contain 79 papers. the topics discussed include: a novel analog module placement procedure based on hierarchical genetic algorithm;optimizing dynamical fuzzy systems using aging evolution strategies;realization of rational genetic algorithm;layered server-client model for asynchronous parallel distributed GA and its parameter;phase recovery from a single fringe pattern through the use of a genetic algorithm;application of evolutionary algorithms to the design of logic circuits consisted of multi-input gates;using fuzzy evolutionary programming to solve traveling salesman problems;evolutionary programming with exponential mutation;optimized fuzzy controller for a helicopter;speed control of an induction motor by using fuzzy variable structure controller;a fuzzy model for long-term financial time series;and a hybrid algorithm for random fuzzy expected value models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Null-space-based Verification Scheme for Coded Edge computing against Pollution Attacks 25

A Null-space-based Verification Scheme for Coded Edge Comput...

引用

25th IEEE international conference on parallel and distributed systems (IEEE ICPADS)

作者： Fu, Mingjia Wang, Jin Zhou, Jingya Wang, Jianping Lu, Kejie Zhou, Xiaobo Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing Peoples R China Georgia Inst Technol Dept Comp Sci Atlanta GA 30332 USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Univ Puerto Rico Dept Comp Sci & Engn Mayaguez PR USA Tianjin Univ Dept Comp Sci & Technol Tianjin Peoples R China

ISBN: (纸本)9781728125831

Edge computing is attracting more and more attention in recent years to fulfill the requirements of latency-critical and computation-intensive applications. By using the coding redundancy, coded edge computing has emerged to optimize the total computation latency. Compared with the servers in cloud computing, edge devices located at the edge of network may not be reliable and trustworthy. In coded edge computing, even one incorrect intermediate result will lead to the incorrect final result. therefore, considering the low computation capabilities of edge devices and low latency requirements of user, we study the result verification problem for coded edge computing. Specifically, we propose an efficient Orthogonal Mark (OM) verification scheme by the properties of linear space. We also conduct solid theoretical analysis to show the successful verification probabilities under two kinds of attack models, respectively. Finally, we conduct extensive simulations to show the effectiveness of the proposed OM verification scheme when comparing with basic coded edge computing scheme and Decoding Comparison (DC) scheme.

关键词： verifiable computation null space edge computing linear coding distributed computing

来源：评论

学校读者我要写书评

暂无评论

ROUTING TABLES FOR MESSAGE ROUTING IN distributed DOUBLE LOOP NETWORKS 18

ROUTING TABLES FOR MESSAGE ROUTING IN DISTRIBUTED DOUBLE LOO...

引用

18th international conference on Computers and their Applications, CATA 2003

作者： Kar, Dulal C. Rao, V. V. Bapeswara Department of Computing and Mathematical Sciences Texas A&M University-Corpus Christi Corpus ChristiTX78412 United States Department of Electrical and Computer Engineering North Dakota State University FargoND58105 United States

ISBN: (纸本)9781618395498

distributed double loop networks are very advantageous for the design and implementation of local area networks and parallel processing architectures, mainly due to their fault-tolerance, low communication latency, and regularity. In this paper, an algorithm for the formulation of routing tables that facilitate routing of messages in a distributed double loop network is presented. the algorithm takes O(d) steps to formulate the routing tables, where d is the diameter of the network. this algorithm is based on breadth first search technique [8]. It finds the distance table for a given node first and then computes the routing table from the distance table. In contrast with some similar works, knowledge of the diameter of the network is not required. the algorithm can also be applied to any similar graph with appropriate modification. © 18th international conference on Computers and their Applications 2003, CATA 2003. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Communication-Space efficient parallel bitonic sorting on symmetric multiprocessors

Communication-Space efficient parallel bitonic sorting on sy...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： thanakulwarapas, Tipraporn Werapun, Jeeraporn Ladkrabang Bangkok 10520 Thailand

ISBN: (纸本)9780889867307

this paper presents a new efficient data-exchange process in parallel sorting, which improves both communication time and memory space. In this communication-space efficient strategy, we proposed two new parallel sorting algorithms: 1) CSEBS (Communication-Space Efficient Bitonic Sort) algorithm and 2) CSEOE (Communication-Space Efficient Odd-Even MergeSort) algorithm. In addition, to evaluate the performance, we have implemented the CSEBS and the CSEOE algorithms on the SGI Origin2000. Investigated experimental results have been compared to those of the best of existing algorithm (CEBS: Communication Efficient Bitonic Sort). In the experiments, the proposed CSEBS algorithm yielded the improved results over those of the best of existing algorithm (CEBS) at least 11% on the system of size P = 4 and at least 31% on the system of size P = 8. Moreover our approach can save memory space up to 50%.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：