scholarly journals Data-Intensive HPC Tasks Scheduling with SDN to Enable HPC-as-a-Service

2015 ◽  
Author(s):  
Saba Jamalian ◽  
Hassan Rajaei
Keyword(s):  
Data Intensive ◽  
Tasks Scheduling

CSO Modelling Considering Moving Storms and Tipping Bucket Gauge Failures

2007 ◽  
Vol 2 (1) ◽  
Author(s):  
M. Hochedlinger ◽  
W. Sprung ◽  
H. Kainz ◽  
K. König
Keyword(s):  
Hydrological Models ◽  
Rain Intensity ◽  
Hydrodynamic Models ◽  
Data Intensive ◽  
Storm Flow ◽  
Cell Velocity ◽  
Combined Sewer ◽  
Moving Direction ◽  
The Difference

The simulation of combined sewer overflow volumes and loads is important for the assessment of the overflow and overflow load to the receiving water to predict the hydraulic or the pollution impact. Hydrodynamic models are very data-intensive and time-consuming for long-term quality modelling. Hence, for long-term modelling, hydrological models are used to predict the storm flow in a fast way. However, in most cases, a constant rain intensity is used as load for the simulation, but in practice even for small catchments rain occurs in rain cells, which are not constant over the whole catchment area. This paper presents the results of quality modelling considering moving storms depending on the rain cell velocity and its moving direction. Additionally, tipping bucket gauge failures and different corrections are also taken into account. The results evidence the importance of these considerations for precipitation due the effects on overflow load and show the difference up to 28% of corrected and uncorrected data and of moving rain cells instead of constant raining intensities.

Enhancing the use of Object Based Contents Addressable Storage

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Simab Hasan Rizvi
Keyword(s):  
File System ◽  
Application Performance ◽  
Shared Storage ◽  
Data Intensive ◽  
Network Bandwidth ◽  
Storage Performance ◽  
Efficient Management ◽  
Object Based ◽  
Data Volume ◽  
Potential Benefits

In Today's age of Tetra Scale computing, the application has become more data intensive than ever. The increased data volume from applications, in now tackling larger and larger problems, and has fuelled the need for efficient management of this data. In this paper, a technique called Content Addressable Storage or CAS, for managing large volume of data is evaluated. This evaluation focuses on the benefits and demerits of using CAS it focuses, i) improved application performance via lockless and lightweight synchronization ofaccess to shared storage data, ii) improved cache performance, iii) increase in storage capacity and, iv) increase network bandwidth. The presented design of a CAS-Based file store significantly improves the storage performance that provides lightweight lock less user defined consistency semantics. As a result, this file system shows a 28% increase in read bandwidth and 13% increase in write bandwidth, over a popular file system in common use. In this paper the potential benefits of using CAS for a virtual machine are estimated. The study also explains mobility application for active use and public deployment.

scholarly journals An Adaptive Scheduler for Real-Time Operating Systems to Extend WSN Nodes Lifetime

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Roberto Rodriguez-Zurrunero ◽  
Ramiro Utrilla ◽  
Elena Romero ◽  
Alvaro Araujo
Keyword(s):  
Operating System ◽  
Real Time ◽  
Operating Systems ◽  
Research Area ◽  
Rechargeable Batteries ◽  
Wireless Sensor ◽  
Portable Devices ◽  
Wireless Devices ◽  
Changing Environments ◽  
Tasks Scheduling

Wireless Sensor Networks (WSNs) are a growing research area as a large of number portable devices are being developed. This fact makes operating systems (OS) useful to homogenize the development of these devices, to reduce design times, and to provide tools for developing complex applications. This work presents an operating system scheduler for resource-constraint wireless devices, which adapts the tasks scheduling in changing environments. The proposed adaptive scheduler allows dynamically delaying the execution of low priority tasks while maintaining real-time capabilities on high priority ones. Therefore, the scheduler is useful in nodes with rechargeable batteries, as it reduces its energy consumption when battery level is low, by delaying the least critical tasks. The adaptive scheduler has been implemented and tested in real nodes, and the results show that the nodes lifetime could be increased up to 70% in some scenarios at the expense of increasing latency of low priority tasks.

scholarly journals Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

Constraints ◽  
2021 ◽  
Author(s):  
Jana Koehler ◽  
Josef Bürgler ◽  
Urs Fontana ◽  
Etienne Fux ◽  
Florian Herzog ◽  
...  
Keyword(s):  
State Of The Art ◽  
Precedence Constraints ◽  
Traveling Salesman ◽  
Mixed Integer ◽  
Automated Manufacturing ◽  
Scheduling Problem ◽  
Tasks Scheduling ◽  
Optimization Modulo Theories ◽  
Coupled Tasks ◽  
Np Hardness

AbstractCable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine. In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of a cable tree. We summarize our investigations to model this cable tree wiring problem (CTW). as a traveling salesman problem with atomic, soft atomic, and disjunctive precedence constraints as well as tour-dependent edge costs such that it can be solved by state-of-the-art constraint programming (CP), Optimization Modulo Theories (OMT), and mixed-integer programming (MIP). solvers. It is further shown, how the CTW problem can be viewed as a soft version of the coupled tasks scheduling problem. We discuss various modeling variants for the problem, prove its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances. The complete benchmark set with all models and instance data is available on github and was included in the MiniZinc challenge 2020.

scholarly journals Bloom Filter-Based Parallel Architecture for Accelerating Equi-Join Operation on FPGA

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1778
Author(s):  
Binhao He ◽  
Meiting Xue ◽  
Shubiao Liu ◽  
Wei Luo
Keyword(s):  
Relational Databases ◽  
Parallel Architecture ◽  
Operation Time ◽  
Bloom Filter ◽  
Search Tree ◽  
Binary Search Tree ◽  
Maximum Acceleration ◽  
Data Intensive ◽  
Match Rate ◽  
Field Programmable

As one of the most important operations in relational databases, the join is data-intensive and time-consuming. Thus, offloading this operation using field-programmable gate arrays (FPGAs) has attracted much interest and has been broadly researched in recent years. However, the available SRAM-based join architectures are often resource-intensive, power-consuming, or low-throughput. Besides, a lower match rate does not lead to a shorter operation time. To address these issues, a Bloom filter (BF)-based parallel join architecture is presented in this paper. This architecture first leverages the BF to discard the tuples that are not in the join result and classifies the remaining tuples into different channels. Second, a binary search tree is used to reduce the number of comparisons. The proposed method was implemented on a Xilinx FPGA, and the experimental results show that under a match rate of 50%, our architecture achieved a high join throughput of 145.8 million tuples per second and a maximum acceleration factor of 2.3 compared to the existing SRAM-based join architectures.

Sign in / Sign up

Export Citation Format

Share Document