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

performance modeling and analysis of hypoexponential network servers

TELECOMMUNICATION SYSTEMS 2017年第4期65卷 717-728页

作者： Salah, Khaled El Kafhali, Said Khalifa Univ Sci Technol & Res KUSTAR Elect & Comp Engn Dept Abu Dhabi U Arab Emirates Hassan 1st Univ Natl Sch Appl Sci Comp Networks Mobil & Modeling Lab Settat Morocco

Hypoexponential servers are commonly seen in today's computer and communication networks whereby incoming packets are processed by the network server in multiple stages with each stage having a different processing time. This paper presents an analytical model to capture the behavior and subsequently analyze the performance of these network servers or similarly behaving systems. From our model, we derive key performance measures and features which include CPU utilization, system idleness, mean throughput, packet loss, mean system and queuing packet delays, and mean system and queue sizes. In addition, we present two popular finite queueing models (namely, M / D / 1 / K and M / M / 1 / K) to approximate our hypoexponential model. Results show that the both of these approximate models give close results when the system queue size is large.

关键词： Network servers Finite queueing systems Hypoexponential service performance modeling and analysis

来源：评论

学校读者我要写书评

暂无评论

performance modeling and analysis of Object Oriented Distributed Software Systems: A Necessary Step Toward Software performance Stability

Performance Modeling and Analysis of Object Oriented Distrib...

引用

3rd IEEE/ACS International Conference on Computer Systems and Applications (AICCSA-05)

作者： Ammar, Reda Abdel-raouf, Amal Fergany, Tahany A. Univ Connecticut Comp Sc & Engr Dept Storrs CT 06269 USA

ISBN: (纸本)9780780387355

Advances in object-oriented (OO) technology and distributed computing generate distributed object oriented software systems. Choosing an efficient design of such software is a multi-criteria decision problem. performance is a key criterion that makes software developers be able to select the system that best fit their requirements and achieve longer design stability. Classical techniques of performance analysis are either unsuitable or unnatural to capture performance behavior of OO systems. In this paper, we present performance-Based Model for Distributed OO Software (DOOS) and a methodology to analyze and evaluate its performance. The new model evaluates the time cost of DOOS system considering the communication overheads while preserving the OO features such as encapsulations and inheritance.

关键词： software performance stability performance modeling and analysis Object-Oriented software

来源：评论

学校读者我要写书评

暂无评论

performance modeling and analysis of parallel Gaussian elimination on multi-core computers

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2014年第1期26卷 41-54页

作者： Sibai, Fadi N. Ctr Saudi Aramco P & CSD Dept Dhahran 31311 Saudi Arabia

Gaussian elimination is used in many applications and in particular in the solution of systems of linear equations. This paper presents mathematical performance models and analysis of four parallel Gaussian Elimination methods ( precisely the Original method and the new Meet in the Middle -MiM- algorithms and their variants with SIMD vectorization) on multi-core systems. Analytical performance models of the four methods are formulated and presented followed by evaluations of these models with modern multi-core systems' operation latencies. Our results reveal that the four methods generally exhibit good performance scaling with increasing matrix size and number of cores. SIMD vectorization only makes a large difference in performance for low number of cores. For a large matrix size ( n >= 16 K), the performance difference between the MiM and Original methods falls from 16 k with four cores to 4x with 16 K cores. The efficiencies of all four methods are low with 1 K cores or more stressing a major problem of multi-core systems where the network-on-chip and memory latencies are too high in relation to basic arithmetic operations. Thus Gaussian Elimination can greatly benefit from the resources of multi-core systems, but higher performance gains can be achieved if multi-core systems can be designed with lower memory operation, synchronization, and interconnect communication latencies, requirements of utmost importance and challenge in the exascale computing age. (C) 2013 Production and hosting by Elsevier B.V. on behalf of King Saud University.

关键词： Gaussian elimination Multi-core computing performance modeling and analysis

来源：评论

学校读者我要写书评

暂无评论

analysis OF DUAL-SHUTTLE AUTOMATED STORAGE-RETRIEVAL SYSTEMS

引用

JOURNAL OF MANUFACTURING SYSTEMS 1994年第6期13卷 424-434页

作者： KESERLA, A PETERS, BA Blom Industries Inc. Mount Clemens Michigan USA Texas A&M University College Station Texas USA

This paper addresses the throughout improvement possible using a dual-shuttle automated storage/retrieval system. Travel-between time in a dual-command cycle is virtually eliminated, resulting in large throughput improvement. The system is extended to perform an equivalent of two dual commands in one cycle in a quadruple-command mode (QC). A heuristic that sequences retrievals to minimize travel time in the QC mode is developed. Monte Carlo simulation results show that the heuristic performs well, achieving large throughput improvement compared with that of the dual-command cycle operating under the nearest-neighbor retrieval-sequencing heuristic.

关键词： AUTOMATED STORAGE RETRIEVAL SYSTEMS DESIGN AUTOMATED STORAGE RETRIEVAL SYSTEMS OPERATION MATERIAL HANDLING SYSTEMS performance modeling and analysis

来源：评论

学校读者我要写书评

暂无评论

modeling and performance Assessment of Dynamic Rate Adaptation for M2M Communications

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2020年第1期7卷 285-303页

作者： Wu, Yalong Yu, Wei Griffith, David Golmie, Nada Towson Univ Dept Comp & Informat Sci Towson MD 21252 USA NIST Commun Technol Lab Gaithersburg MD 20899 USA

With the advance of Internet of Things and the support of a diverse array of smart-world applications, the number of Machine-to-Machine (M2M) devices has continued to grow at an accelerated rate. This significant and unchecked increase poses enormous challenges to both M2M infrastructure and the coexistence of M2M applications. In this paper, we model the traffic arrival patterns of time-driven, event-driven and loop-driven M2M applications, and propose a novel dynamic rate adaptation (DRA) scheme to obtain an optimized service rate distribution among a mixture of diverse M2M applications. DRA introduces real-time monitoring of M2M traffic arrival rate, building on which a service rate distribution between M2M applications can be incrementally adjusted moment to moment, through the use of the mean value theorem of integrals (MVTI) and generalized processor sharing (GPS). Via a combination of both theoretical analysis and extensive performance evaluation, we have validated the effectiveness of our proposed DRA scheme. Our experimental results demonstrate that DRA can significantly improve M2M communications performance with respect to throughput, delay, and energy consumption. In addition, we extend our proposed DRA scheme from the perspective of Device-to-Device (D2D) communications and further discuss the resilience of DRA.

关键词： Internet of Things M2M communications dynamic rate adaptation resource allocation performance modeling and analysis network science and engineering for smart-world applications

来源：评论

学校读者我要写书评

暂无评论

SIMULATION EXPERIMENTS FOR performance analysis OF MULTIPLE-BUS MULTIPROCESSOR SYSTEMS WITH NONEXPONENTIAL SERVICE TIMES

引用

SIMULATION 1989年第1期52卷 18-23页

作者： ONYUKSEL, IH IRANI, KB UNIV MICHIGAN DEPT ELECT ENGN & COMP SCIANN ARBORMI 48109

A simulation model (program) is constructed for performance analysis of multiple-bus multiprocessor systems with shared memories. It is assumed that the service time of the common memory is either hypo- or hyperexponentially distributed. Process ing efficiency is used as the performance index. To investigate the effects of different service time distributions on the system perfor mance, comparative results are obtained for a large set of input parameters. The simulation results show that the error in approx imating the memory access time by an exponentially distributed random variable is less than 6% if the coefficient of variation is less than 1, but it increases drastically with this factor if it is greater than 1.

关键词： Multiprocessor systems nonexponential service times performance modeling and analysis pro cessing efficiency simulation models.

来源：评论

学校读者我要写书评

暂无评论

Latency analysis of the totem single-ring protocol

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2001年第5期9卷 669-680页

作者： Thomopoulos, E Moser, LE Melliar-Smith, PM Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

The Totem single-ring protocol provides reliable totally ordered multicasting of messages to processes in process groups over a single local-area network (LAN) using a logical token-passing ring. The protocol provides two levels of message delivery: delivery in agreed order and delivery in safe order. This paper presents the probability density functions (pdfs) for the latency to message delivery for the Totem single-ring protocol for these two levels of service in the presence of both message loss and token loss. These pdfs are calculated by repeated convolutions of the pdfs for the various components of the latency. The analysis shows that the mean latency to safe delivery is greater than the mean latency to agreed delivery and that the tail of the latency distribution for safe delivery is longer. It also shows that a deterministic arrival process for message generation exhibits lower mean latencies and shorter tails of the latency distribution than a Poisson arrival process.

关键词： message delivery latency multicast protocols performance modeling and analysis probability density functions

来源：评论

学校读者我要写书评

暂无评论

A performance comparison of locking methods with limited wait depth

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1997年第3期9卷 421-434页

作者： Thomasian, A IBM Thomas J. Watson Research Center Hawthorne NY USA

A number of recent studies have proposed lock conflict resolution methods to improve the performance of standard locking, i.e., strict two-phase locking with the general waiting method. This paper is primarily concerned with the performance of wait depth limited methods with respect to each other and some other methods. The methods considered include the general waiting, wound-wait, and no-waiting methods, symmetric and asymmetric Versions of cautious waiting and running priority methods, the wait depth limited (WDL) method, and a modified Version of it. In spite of the availability of analytic solutions for most of wait depth limited methods, for reasons given in the paper, the performance comparison is based on simulation results. The contributions of this study are as follows: 1) modeling assumptions, i.e., a careful definition of transaction restart options;2) new results concerning the relative performance of wait depth limited methods, which show that a) the running priority method outperforms cautious waiting and may even outperform the WDL method in a system with limited hardware resource, b) WDL outperforms other methods in high lock contention, high capacity systems, and c) modified WDL has a performance comparable to WDL, but incurs less overhead in selecting the abort victim;and 3) contrary to common belief, Tay's Effective Database Size Paradigm for dealing with shared and exclusive locks and/or skewed database accesses in standard locking is applicable to some wait depth limited methods and provides acceptably accurate approximations in others--as long as locking modes for restarted transactions are not resampled.

关键词： transaction processing concurrency control data contention two-phase locking load control running priority method wait depth limited method cautious waiting method wound wait method no-waiting method performance modeling and analysis simulation

来源：评论

学校读者我要写书评

暂无评论

performance modeling and prediction of nondedicated network computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2002年第9期51卷 1041-1055页

作者： Gong, LG Sun, XH Watson, EF Rider Univ Dept Management Sci Lawrenceville NJ 08603 USA IIT Dept Comp Sci Chicago IL 60616 USA Louisiana State Univ Dept Informat Syst & Decis Sci Baton Rouge LA 70803 USA

The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be readily available, these workstations may be privately owned and the owners may not want others to interrupt their priority in using the computer. Assuming machine owners have a preemptive priority, in this paper, we study the parallel processing capacity of a privately owned network of workstations. A mathematical model is developed to predict performance for nondedicated network computing. It also considers systems with heterogeneous machine utilization and heterogeneous service distribution. This model separates the influence of machine utilization, sequential job service rate, and parallel task allocation on the parallel completion time. It is simple and valuable for guiding task scheduling in a nondedicated environment.

关键词： network cluster computing performance modeling and analysis nondedicated systems workload distribution

来源：评论

学校读者我要写书评

暂无评论

Efficient and dynamic scaling of fog nodes for IoT devices

引用

JOURNAL OF SUPERCOMPUTING 2017年第12期73卷 5261-5284页

作者： El Kafhali, Said Salah, Khaled Hassan 1st Univ Natl Sch Appl Sci Comp Networks Mobil & Modeling Lab Settat Morocco Khalifa Univ Sci Technol & Res Elect & Comp Engn Dept Abu Dhabi U Arab Emirates

It is predicted by the year 2020, more than 50 billion devices will be connected to the Internet. Traditionally, cloud computing has been used as the preferred platform for aggregating, processing, and analyzing IoT traffic. However, the cloud may not be the preferred platform for IoT devices in terms of responsiveness and immediate processing and analysis of IoT data and requests. For this reason, fog or edge computing has emerged to overcome such problems, whereby fog nodes are placed in close proximity to IoT devices. Fog nodes are primarily responsible of the local aggregation, processing, and analysis of IoT workload, thereby resulting in significant notable performance and responsiveness. One of the open issues and challenges in the area of fog computing is efficient scalability in which a minimal number of fog nodes are allocated based on the IoT workload and such that the SLA and QoS parameters are satisfied. To address this problem, we present a queuing mathematical and analytical model to study and analyze the performance of fog computing system. Our mathematical model determines under any offered IoT workload the number of fog nodes needed so that the QoS parameters are satisfied. From the model, we derived formulas for key performance metrics which include system response time, system loss rate, system throughput, CPU utilization, and the mean number of messages request. Our analytical model is cross-validated using discrete event simulator simulations.

关键词： Internet of things Fog computing Edge computing Cloud computing Queuing theory performance modeling and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：