Nancy: An efficient parallel Network Calculus library

نویسندگان

چکیده

This paper describes Nancy, a Network Calculus (NC) library that allows users to perform complex min-plus and max-plus algebra operations efficiently. To the best of our knowledge, Nancy is only open-source implements working on arbitrary piecewise affine functions, as well implement some them (e.g. sub-additive closure function composition). researchers compute NC results using straightforward syntax, which matches algebraic one. Moreover, it designed having computational efficiency in mind: exploits optimizations data structures, uses inheritance allow for faster algorithms when they are available (e.g., specific subclasses functions), natively parallel, thus reaping benefit multicore hardware. makes usable solve problems were previously considered beyond realm tractable.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Library for Parallel Ray Tracing and Animation

A parallel ray tracing library is presented for rendering high detail images of three dimensional geometry and computational fields. The library has been developed for use on distributed memory and shared memory parallel computers and can also run on sequential computers. Parallelism is achieved through the use of message passing and threads. It is shown that the library achieves almost linear ...

متن کامل

ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations

Kernel-based methods are a powerful tool in a variety of machine learning and computational statistics methods. A key bottleneck in these methods is computations involving the kernel matrix, which scales quadratically with the problem size. Previously, we introduced ASKIT, an efficient, scalable, kernel-independent method for approximately evaluating kernel matrix-vector products. ASKIT is base...

متن کامل

Somoclu: An Efficient Parallel Library for Self-Organizing Maps

Somoclu is a massively parallel tool for training self-organizing maps on large data sets written in C++. It builds on OpenMP for multicore execution, and on MPI for distributing the workload across the nodes in a cluster. It is also able to boost training by using CUDA if graphics processing units are available. A sparse kernel is included, which is useful for high-dimensional but sparse data,...

متن کامل

An Efficient Extension of Network Simplex Algorithm

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

متن کامل

Efficient Interprocedural Data Placement Optimisation in a Parallel Library

This paper describes a combination of methods which make interprocedural data placement optimisation available to parallel libraries. We propose a delayed-evaluation, self-optimising (DESO) numerical library for a distributed-memory multicomputer. Delayed evaluation allows us to capture the control-ow of a user program from within the library at runtime, and to construct an optimised execution ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SoftwareX

سال: 2022

ISSN: ['2352-7110']

DOI: https://doi.org/10.1016/j.softx.2022.101178