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

International Symposium on Object-Oriented Real-Time distributed Computing

作者： Volkmar Sieh Robert Burlacu Timo Hönig Heiko Janker Phillip Raffeck Peter Wägemann Wolfgang Schröder-Preikschat Department of Computer Science Distributed Systems and Operating Systems Friedrich-Alexander University Erlangen-Nürnberg (FAU) Department of Mathematics Economics · Discrete Optimization · Mathematics Friedrich-Alexander University Erlangen-Nürnberg (FAU)

Reliable and fine-grained cost-models are fundamental for real-time systems to statically predict worst-case execution time (WCET) estimates of program code in order to guarantee timeliness. Analogous considerations hold for energy-constrained systems where worst-case energy consumption (WCEC) values are mandatory to ensure meeting predefined energy budgets. These cost models are generally unavailable for commercial off-the-shelf (COTS) hardware platforms, although static worst-case analysis tools require those models in order to predict the WCET as well as the WCEC of program code. To solve this problem, we present NEO, an end-to-end toolchain to automate cost-model generation for both WCET and WCEC analyses. NEO exploits automatically generated benchmarks, which are input for 1) an instruction-level emulation and 2) automatically conducted execution-time and energy-consumption measurements on the target platform. The gathered values (i.e., occurrences per instruction, execution-time and energyconsumption per benchmark) are combined as mathematical optimization problems. The solutions to the formulated problems, which are designed to reveal the worst-case behavior, yield the respective cost models. To statically determine upper bounds of benchmarks, we integrated the cost models into the stateof-the-art WCET analyzer PLATIN. Our evaluations on COTS hardware reveal that our open-source, end-to-end toolchain NEO yields accurate worst-case bounds.

关键词： Benchmark testing Mathematical model Integrated circuits Analytical models Energy measurement Energy consumption Time measurement

来源：评论

学校读者我要写书评

暂无评论

Approximate analysis of access contention for multiprocessor systems with common bus arbiters

引用

systems AND COMPUTERS IN JAPAN 1996年第9期27卷 12-22页

作者： Hoshiai, T Member NTT Network Service Systems Laboratories Musashino Japan 180 Takashige Hoshai:received his B.S. and M.S. degrees in 1984 and 1986 respectively from Toyohashi Univ. of Tech. where he received his Ph.D. degree. In 1986 he joined NIT Communication Switching Laboratories and is Senior Researcher at IIT Network Service Systems Laboratories. At present he is engaged in research on distributed systems at Bell Communication Lab. (USA). His main interests are real time operating systems computer architecture and distributed systems.

In multiprocessor systems with a common bus arbiter, contention for access to the common bus and shared memory is a major cause of performance degradation. The first-order moment match approximation is an effective technique of performance evaluation in such systems. Comparison with simulation results demonstrates that the first-order moment match technique gives good accuracy. The performance of completely coupled multiprocessor systems is compared with that of bus-arbitrated multiprocessor systems in order to determine the applications for which the latter is best suited.

关键词： Multiprocessor system access contention bus arbiter first-order moment matching

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence for IT Operations (AIOPS) workshop white paper

arXiv

引用

arXiv 2021年

作者： Bogatinovski, Jasmin Nedelkoski, Sasho Acker, Alexander Schmidt, Florian Wittkopp, Thorsten Becker, Soeren Cardoso, Jorge Kao, Odej Distributed and Operating Systems Group Technische Universität Berlin Berlin Germany Huawei Munich Research Center Munich Germany University of Coimbra CISUC DEI Portugal

来源：评论

学校读者我要写书评

暂无评论

Polyjuice: High-performance transactions via learned concurrency control

arXiv

引用

arXiv 2021年

作者： Wang, Jiachen Ding, Ding Wang, Huan Christensen, Conrad Wang, Zhaoguo Chen, Haibo Li, Jinyang Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai AI Laboratory China Engineering Research Center for Domain-specific Operating Systems Ministry of Education China Department of Computer Science New York University

Concurrency control algorithms are key determinants of the performance of in-memory databases. Existing algorithms are designed to work well for certain workloads. For example, optimistic concurrency control (OCC) is better than twophase- locking (2PL) under low contention, while the converse is true under high contention. To adapt to different workloads, prior works mix or switch between a few known algorithms using manual insights or simple heuristics. We propose a learning-based framework that instead explicitly optimizes concurrency control via offline training to maximize performance. Instead of choosing among a small number of known algorithms, our approach searches in a "policy space" of fine-grained actions, resulting in novel algorithms that can outperform existing algorithms by specializing to a given workload. We build Polyjuice based on our learning framework and evaluate it against several existing algorithms. Under different configurations of TPC-C and TPC-E, Polyjuice can achieve throughput numbers higher than the best of existing algorithms by 15% to 56%. Copyright © 2021, The Authors. All rights reserved.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

AuctionWhisk: Using an auction-inspired approach for function placement in serverless fog platforms

arXiv

引用

arXiv 2021年

作者： Bermbach, David Bader, Jonathan Hasenburg, Jonathan Pfandzelter, Tobias Thamsen, Lauritz Mobile Cloud Computing Research Group TU Berlin Einstein Center Digital Future Berlin Germany Distributed and Operating Systems Research Group TU Berlin Germany

The Function-as-a-Service (FaaS) paradigm has a lot of potential as a computing model for fog environments comprising both cloud and edge nodes, as compute requests can be scheduled across the entire fog continuum in a fine-grained manner. When the request rate exceeds capacity limits at the resource-constrained edge, some functions need to be offloaded towards the cloud. In this paper, we present an auction-inspired approach in which application developers bid on resources while fog nodes decide locally which functions to execute and which to offload in order to maximize revenue. Unlike many current approaches to function placement in the fog, our approach can work in an online and decentralized manner. We also present our proof-of-concept prototype AuctionWhisk that illustrates how such an approach can be implemented in a real FaaS platform. Through a number of simulation runs and system experiments, we show that revenue for overloaded nodes can be maximized without dropping function requests. Copyright © 2021, The Authors. All rights reserved.

关键词： Fog

来源：评论

学校读者我要写书评

暂无评论

Real-Time Traffic Congestion Detection for Driver-Centric Applications

Real-Time Traffic Congestion Detection for Driver-Centric Ap...

引用

International Conference on distributed Computing systems Workshop

作者： Philipp Kisters Tim Bauer Wolf Posdorfer Janick Edinger Distributed Operating Systems Universität Hamburg Hamburg Germany Mercedes-Benz Group AG Stuttgart Germany Computer Networks Universität Hamburg Hamburg Germany

With the increasing time drivers spent behind the wheel, availability of accurate, reliable, and comprehensive information on real-time traffic conditions is becoming increasingly important for individual road users, industry, and traffic authorities. Due to a growing amount of traffic combined with insufficient transportation infrastructure, traffic congestion is one of the major challenges modern society has to face in urban areas. While this results in serious environmental issues such as pollution, congestions also have significant effects on drivers’ stress levels, which further is an essential factor in driver behavior and road safety. In this paper, we analyze real-time traffic situations on a fine-granular level by computing the local congestion factor, which represents traffic conditions on currently traversed route segments. We show that travel time predictions for short- and mid-term routes provided by four major public traffic information providers can be used for computing congestion factors in real-time, which can then be used as input for driver-centric applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PrometheusMigrate: Efficient Live Migration of Confidential Virtual Machine with Software Abstraction

PrometheusMigrate: Efficient Live Migration of Confidential ...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Chenhui Ji Dingji Li Zeyu Mi Yubin Xia Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University Engineering Research Center for Domain-Specific Operating Systems Ministry of Education China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

With the rise of cloud computing, the use of virtual machines in data centers has become genuinely common. To achieve load balance and disaster recovery between different hosts when a virtual machine is providing services, the concept of live migration has been proposed and has now become one of the essential capabilities in data centers. On the other hand, users’ concerns about data privacy when applications are deployed on cloud vendors’ servers are also rising, and for this reason, confidential virtual machines, a new type of virtualization hardware, have been proposed. However, since the memory of confidential VMs is usually encrypted, existing live migration solutions cannot be applied to confidential VMs directly, so hardware vendors have come up with various solutions to support this critical feature. For example, the mainstream confidential virtualization hardware platform – AMD-SEV, adds a series of interfaces in their secure firmware to assist the hypervisor to achieve live migration capability. However, this solution can cause the live migration time to be too long due to the limited number of secure processors and computing power. In this paper, we propose a new software design: PROMETHEUSMIGRATE. PROMETHEUSMIGRATE presents a novel software abstraction that bypasses SEV’s secure firmware with guaranteed security, thereby dramatically accelerating the total live migration time as well as downtime of the AMD-SEV platform.

关键词： Cloud computing Data centers Virtual machine monitors Software design Program processors Memory management Hardware

来源：评论

学校读者我要写书评

暂无评论

An Optical Transceiver Reliability Study based on SFP Monitoring and OS-level Metric Data

An Optical Transceiver Reliability Study based on SFP Monito...

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： Paolo Notaro Qiao Yu Soroush Haeri Jorge Cardoso Michael Gerndt Huawei Technologies Duesseldorf GmbH Munich Germany Chair of Computer Architecture and Parallel Systems Technical University of Munich Germany Chair of Distributed and Operating Systems Technical University of Berlin Germany Department of Informatics Engineering/CISUC University of Coimbra Portugal

The increasing demand for cloud computing drives the expansion in scale of datacenters and their internal optical network, in a strive for increasing bandwidth, high reliability, and lower latency. Optical transceivers are essential elements of optical networks, whose reliability has not been well-studied compared to other hardware components. In this paper, we leverage high quantities of monitoring data from optical transceivers and OS-level metrics to provide statistical insights about the occurrence of optical transceiver failures. We estimate transceiver failure rates and normal operating ranges for monitored attributes, correlate early-observable patterns to known failure symptoms, and finally develop failure prediction models based on our analyses. Our results enable network administrators to deploy early-warning systems and enact predictive maintenance strategies, such as replacement or traffic re-routing, reducing the number of incidents and their associated costs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

sNPU: Trusted Execution Environments on Integrated NPUs

sNPU: Trusted Execution Environments on Integrated NPUs

引用

Annual International Symposium on Computer Architecture, ISCA

作者： Erhu Feng Dahu Feng Dong Du Yubin Xia Haibo Chen Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University Department of Precision Instrument Tsinghua University Engineering Research Center for Domain-specific Operating Systems Ministry of Education China Key Laboratory of System Software (Chinese Academy of Sciences)

ISBN: (数字)9798350326581

ISBN: (纸本)9798350326598

Trusted execution environment (TEE) promises strong security guarantee with hardware extensions for security-sensitive tasks. Due to its numerous benefits, TEE has gained widespread adoption, and extended from CPU-only TEEs to FPGA and GPU TEE systems. However, existing TEE systems exhibit inadequate and inefficient support for an emerging (and significant) processing unit, NPU. For instance, commercial TEE systems resort to coarse-grained and static protection approaches for NPUs, resulting in notable performance degradation (10%–20%), limited (or no) multitasking capabilities, and suboptimal resource utilization. In this paper, we present a secure NPU architecture, known as sNPU, which aims to mitigate vulnerabilities inherent to the design of NPU architectures. First, sNPU proposes NPU Guarder to enhance the NPU’s access control. Second, sNPU defines new attack surfaces leveraging in-NPU structures like scratchpad and NoC, and designs NPU Isolator to guarantee the isolation of scratchpad and NoC routing. Third, our system introduces a trusted software module called NPU Monitor to minimize the software TCB. Our prototype, evaluated on FPGA, demonstrates that sNPU significantly mitigates the runtime costs associated with security checking (from upto 20% to 0%) while incurring less than 1% resource costs.

关键词： Costs Runtime Prototypes Computer architecture Routing Software Resource management

来源：评论

学校读者我要写书评

暂无评论

Works in progress

Works in progress

引用

作者： Curry, Edward Mossière, Jacques Beloued, Abdelkrim Gilliot, Jean-Marie Segarra, Maria-Teresa André, Françoise Dyo, Vladimir Di Muro, Etienne Antoniutti Jaeger, Michael A. National University of Ireland Galway Institut National Polytechnique de Grenoble ENST-Bretagne University of Rennes Department of Computer Science ENST-Bretagne Brest France University of Rennes 1 IRISA INRIA Laboratory Rennes France University College London Department of Computer Science University College London Università degli Studi di Trieste Reliable Distributed Systems Group Università degli Studi di Trieste Italy Berlin University of Technology Communication and Operating Systems Group Berlin University of Technology Germany

The main focuses of the 2nd International Middleware Doctoral Symposium took place at Middleware 2005 are discussed. The symposium is a forum for an invited group of doctoral students and it provides an opportunity for them to obtain guidance from mentors and to meet with their peers. The event is aimed to give students constructive criticism before their thesis defense and foster discussions related to future career opportunities. The symposium attracted many high-quality submissions, ensuring a competitive selection process.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：