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

Reliable distributed Systems

作者： Roy Friedman Erez Hadad Computer Science Department Technion - Israel Institute of Technology Haifa Israel Distributed Computing Systems Group IBM Haifa Research Lab Haifa Israel

This paper presents two novel generic adaptive batching schemes for replicated servers. Both schemes are oblivious to the underlying communication protocols. Our novel schemes adapt their batching levels automatically and immediately according to the current communication load. This is done without any explicit monitoring or calibration of the system. Additionally, the paper includes a detailed performance evaluation

关键词： Delay Throughput Monitoring Protocols Costs Computational efficiency Bandwidth computer science Calibration distributed computing

来源：评论

学校读者我要写书评

暂无评论

Enabling Sustainable and Unmanned Facial Detection and Recognition Services With Adaptive Edge Resource

引用

IEEE Transactions on Consumer Electronics 2024年 1-1页

作者： Xiang, Zhengzhe Xue, Xizi Zheng, Zengwei Gao, Honghao Chen, Yuanyi Dustdar, Schahram School of Computer and Computing Science Hangzhou City University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China School of Computer Engineering and Science Shanghai University Shanghai China Distributed Systems Group TU Wien Vienna Austria

Facial recognition techniques are used extensively in areas like online payments, education, and social media. Traditionally, these applications relied on powerful cloud-based systems, but advancements in edge computing have changed this, enabling fast and reliable local processing in complex and extreme environments. However, new challenges arise in availability and durability insurance to make the system run 24/7 with acceptable performance. This paper proposes a novel solution to these challenging settings. First, we use edge devices for local data processing, reducing the need for cloud communication and enhancing user privacy. Second, we implement an adaptive control strategy to improve energy management in these devices. Lastly, we establish a solar-powered energy system to facilitate long-term device operation. The experiments show our approach strikes a balance between performance, quality, and durability, enabling facial recognition systems to work energy-efficiently in complex environments. Meanwhile, considering the limited resources of devices in extreme cases, we also proposed a learning-based approach to accelerate the solution generation. IEEE

关键词： Edge computing Edge computing Energy consumption Energy efficiency Energy Harvesting Face recognition Fifth Industrial Revolution Performance evaluation Real-time systems Resource Allocation Service Management

来源：评论

学校读者我要写书评

暂无评论

The Interplay Between Timeliness and Scalability in Cloud Monitoring Systems

The Interplay Between Timeliness and Scalability in Cloud Mo...

引用

IEEE Symposium on computers and Communication

作者： Guilherme da Cunha Rodrigues Rodrigo N. Calheiros Marcio Barbosa de Carvalho Carlos Raniery Paula dos Santos Lisandro Zambenedetti Granville Liane Tarouco Rajkumar Buyya Computer Networks Group Institute of Informatics Federal University of Rio Grande do Sul Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computing and Information Systems The University of Melbourne Department of Applied Computing Federal University of Santa Maria

ISBN: (纸本)9781467371957

Cloud computing is a groundbreaking solution to acquire computational resources on demand. To deliver high quality cloud services and provide features such as reduced costs and availability to customers, a cloud, like any other computational system, needs to be properly managed in accordance with its characteristics (e.g., scalability, elasticity, timeliness). In this scenario, cloud monitoring is a key to achieve it. To properly work, cloud monitoring systems need to meet several requirements such as scalability, accuracy, and timeliness. This paper aims to unveil the trade-off between timeliness and scalability. Evaluations demonstrate the mutual influence between scalability and timeliness based on monitoring parameters (e.g., monitoring topologies, frequency sampling). Results show that non-deep monitoring topologies and decreasing the frequency sampling assist to reduce the mutual influence between timeliness and scalability.

关键词： Scalability CLOUDS Clouds monitoring systems Monitoring parameters Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Theoretically Guaranteed Online Workload Dispatching for Deadline-Aware Multi-Server Jobs

arXiv

引用

arXiv 2021年

作者： Zhao, Hailiang Deng, Shuiguang Yin, Jianwei Dustdar, Schahram Zomaya, Albert Y. School of Computer Science and Technology Wuhan University of Technology Wuhan China The Massachusetts Institute of Technology United States China The Distributed Systems Group The Tu Wien Austria The Centre for Distributed and High-Performance Computing The University of Sydney Australia

Multi-server jobs are imperative in modern computing clusters. A multi-server job has multiple task components and each of the task components is responsible for processing a specific size of workloads. Efficient online workload dispatching is crucial but challenging to co-located heterogeneous multi-server jobs. The dispatching policy should decide (i) where to launch each task component instance of the arrived jobs and (ii) the size of workloads that each task component processes. Existing policies are explicit and effective when facing service locality and resource contention in both offline and online settings. However, when adding the deadline-aware constraint, the theoretical superiority of these policies could not be guaranteed. To fill the theoretical gap, in this paper, we design an α-competitive online workload dispatching policy for deadline-aware multi-server jobs based on the spatio-temporal resource mesh model. We formulate the problem as a social welfare maximization program and solve it online with several well designed pseudo functions. The social welfare is formulated as the sum of the utilities of jobs and the utility of the computing cluster. The proposed policy is rigorously proved to be α-competitive for some α ≥ 2. We also validate the theoretical superiority of it with simulations and the results show that it distinctly outperforms two handcrafted baseline policies on the social welfare. © 2021, CC BY-NC-ND.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A Novel Algorithm towards Designing the Protocol for Generation of Secret-Key with Authentication in Collaboration (PGSAC)

A Novel Algorithm towards Designing the Protocol for Generat...

引用

International Symposium on Information Technology Convergence (ISITC)

作者： Shyamasree Mukherjee Sankhayan Choudhury Nabendu Chaki Debajyoti Mukhopadhyay Computer Science & Engineering University of Calcutta Calcutta India Web Intelligence & Distributed Computing Research Laboratory (WIDiCoReL) Techno India Group West Bengal University of Technology Calcutta India

ISBN: (纸本)0769530451

Both symmetric and asymmetric key algorithms are used to secure a network. Asymmetric key approach involves greater time complexity and hence prone to higher power consumption. Symmetric key cryptography, on the other hand, involves a key exchange phase. In this paper, we propose an authentication technique for new nodes to an ad-hoc network that would also extract the advantages of both symmetric and asymmetric key cryptography while avoiding the adversities. In the proposed collaborative technique, the new node is not only authenticated, but the request-reply messages have been used to generate a secret key at the two ends. The proposed algorithm estimates the distance of a node X from the power loss of a message from X. Both the sender and the receiver separately compute the same secret key based on this distance. The proposed algorithm does not use GPS and identifies location of nodes by distance and direction only.

关键词： Algorithm design and analysis Protocols Authentication Collaboration Public key cryptography Public key Ad hoc networks Attenuation Signal processing Information technology

来源：评论

学校读者我要写书评

暂无评论

Anti-Jamming Schedules for Wireless Data Broadcast Systems

Anti-Jamming Schedules for Wireless Data Broadcast Systems

引用

IEEE International Symposium on Information Theory

作者： Paolo Codenotti Alexander Sprintson Jehoshua Bruck Department of Computer Science University of Chicago Chicago IL USA Department of Electrical and Computer Engineering Texas A and M University TX USA Parallel and Distributed Computing Group California Institute of Technology Pasadena CA USA

ISBN: (纸本)142440505X

Modern society is heavily dependent on wireless networks for providing voice and data communications. Wireless data broadcast has recently emerged as an attractive way to disseminate dynamic data to a large number of clients. In data broadcast systems, the server proactively transmits the information on a downlink channel; the clients access the data by listening to the channel. Wireless data broadcast systems can serve a large number of heterogeneous clients, minimizing power consumption as well as protecting the privacy of the clients' locations. The availability and relatively low cost of antennas resulted in a number of potential threats to the integrity of the wireless infrastructure. In particular, the data broadcast systems are vulnerable to jamming, i.e., the use of active signals to prevent data broadcast. The goal of jammers is to cause disruption, resulting in long waiting times and excessive power consumption. In this paper we investigate efficient schedules for wireless data broadcast that perform well in the presence of a jammer. We show that the waiting time of client can be reduced by adding redundancy to the schedule and establish upper and lower bounds on the achievable minimum waiting time under different requirements on the staleness of the transmitted data

关键词： Broadcasting Jamming Energy consumption Wireless networks Data communication Wireless communication Network servers Downlink Power system protection Data privacy

来源：评论

学校读者我要写书评

暂无评论

distributed verification and hardness of distributed approximation

Distributed verification and hardness of distributed approxi...

引用

作者： Sarma, Atish Das Holzer, Stephan Kor, Liah Korman, Amos Nanongkai, Danupon Pandurangan, Gopal Peleg, David Wattenhofer, Roger EBay Research Labs EBay Inc. San Jose CA 95125 United States Computer Distributed Computing Group ETH Zurich CH-8092 Zurich Switzerland Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel CNRS LIAFA Univ. Paris 7 Paris France Theory and Applications of Algorithms Research Group University of Vienna 1090-Vienna Austria Division of Mathematical Sciences Nanyang Technological University Singapore 637371 Singapore Department of Computer Science Brown University Providence RI 02912 United States

We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected (every node knows at the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree (MST), shortest paths, and minimum cut. Many of these results are the first nontrivial lower bounds for both exact and approximate distributed computation, and they resolve previous open questions. Moreover, our unconditional lower bound of approximating MST subsumes and improves upon the previous hardness of approximation bound of Elkin [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433-456] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [D. Peleg and V. Rubinovich, SIAM J. Comput., 30 (2000), pp. 1427-1442]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm for any approximation factor. Our lower bound proofs show an interesting connection between communication complexity and distributed computing which turns out to be useful in establishing the time complexity of exact and approximate distributed computatio

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Dominant representations: a paradigm for mapping parallel computations

Dominant representations: a paradigm for mapping parallel co...

引用

International Symposium on Parallel Processing

作者： A. Mohindra S. Yalamanchili Distributed Systems Group College of Computing Georgia Institute of Technology Atlanta GA USA Computer Systems Research Laboratory School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA

Proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capturing the dominant computation and communication components of an application and using this relatively simpler program representation to determine an assignment. Thus, the mapping problem is reduced from its most general form to a simpler form which often has optimal solutions.< >

关键词： Concurrent computing computer architecture distributed computing Memory architecture Tree graphs Educational institutions Runtime Laboratories Bandwidth Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

PupilRec: Leveraging Pupil Morphology for Recommending on Smartphones

PupilRec: Leveraging Pupil Morphology for Recommending on Sm...

引用

作者： Shen, Xiangyu Jiang, Hongbo Liu, Daibo Yang, Kehua Deng, Feiyang Lui, John C. S. Liu, Jiangchuan Dustdar, Schahram Luo, Jun Hunan University College of Computer Science and Electronic Engineering Hunan Changsha410082 China The City University of Hong Kong School of Graduate Studies Hong Kong The Chinese University of Hong Kong Computer Science and Engineering Department Hong Kong Simon Fraser University School of Computing Science BurnabyBCV5A 1S6 Canada Vienna University of Technology Distributed Systems Group Vienna1040 Austria Nanyang Technological University School of Computer Engineering 639798 Singapore

As mobile shopping has gradually become the mainstream shopping mode, recommendation systems are gaining an increasingly wide adoption. Existing recommendation systems are mainly based on explicit and implicit user behaviors. However, these user behaviors may not directly indicate users' inner feelings, causing erroneous user preference estimation and thus leading to inaccurate recommendations. Inspired by our key observation on the correlation between pupil size and users' inner feelings, we consider using the change of pupil size when browsing to model users' preferences, so as to achieve targeted recommendations. To this end, we propose PupilRec as a computer-vision-based recommendation framework involving a mobile terminal and a server side. On the mobile terminal, PupilRec collects users' pupil size change information through the front camera of smartphones;it then preprocesses the raw pupil size data before transmitting them to the server. On the server side, PupilRec utilizes the Tsfresh package and Random Forest algorithm to figure out the key time-series features directly implying user preferences. PupilRec then trains a neural network to fit a user preference model. Using this model, PupilRec predicts user preference to obtain a user-product matrix and further simplifies it by singular value decomposition. Finally, the real-time recommendation is achieved by a collaborative filtering module that retrieves recommended contents to users smartphones. We prototype PupilRec and conduct both experiments and field studies to comprehensively evaluate the effectiveness of PupilRec by recruiting 67 volunteers. The overall results show that PupilRec can accurately estimate users' preference and can recommend products users interested in. © 2014 IEEE.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Follow-Me AI: Energy-Efficient User Interaction with Smart Environments

arXiv

引用

arXiv 2024年

作者： Saleh, Alaa Donta, Praveen Kumar Morabito, Roberto Motlagh, Naser Hossein Lovén, Lauri Center for Ubiquitous Computing University of Oulu Finland Distributed Systems Group TU Wien Vienna Austria Department of Communication Systems EURECOM France Department of Computer Science University of Helsinki Finland

This article introduces Follow-Me AI, a concept designed to enhance user interactions with smart environments, optimize energy use, and provide better control over data captured by these environments. Through AI agents that accompany users, Follow-Me AI negotiates data management based on user consent, aligns environmental controls as well as user communication and computes resources available in the environment with user preferences, and predicts user behavior to proactively adjust the smart environment. The manuscript illustrates this concept with a detailed example of Follow-Me AI in a smart campus setting, detailing the interactions with the building's management system for optimal comfort and efficiency. Finally, this article looks into the challenges and opportunities related to Follow-Me AI. © 2024, CC BY-NC-ND.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：