scholarly journals Performance Analysis of a High-Level Abstractions-Based Hydrocode on Future Computing Systems

2015 ◽  
pp. 85-104 ◽  
Author(s):  
G. R. Mudalige ◽  
I. Z. Reguly ◽  
M. B. Giles ◽  
A. C. Mallinson ◽  
W. P. Gaudin ◽  
...  
Keyword(s):  
Performance Analysis ◽  
Computing Systems ◽  
High Level

scholarly journals Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling

Computers ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 63
Author(s):  
Fahd Alhaidari ◽  
Taghreed Zayed Balharith
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Role ◽  
Turnaround Time ◽  
Round Robin ◽  
Computing Systems ◽  
Time Quantum ◽  
Dynamic Time ◽  
High Level ◽  
Level Performance

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.

scholarly journals Analisis Efektivitas Kelembagaan Pengelolaan Hutan Bersama Masyarakat (PHBM) di KPH Bandung Utara Jawa Barat

2014 ◽  
Vol 1 (1) ◽  
pp. 1-11
Author(s):  
Bahruzin Bahruzin ◽  
Aceng Hidayat ◽  
Eka Intan Kumala Putri
Keyword(s):  
Forest Management ◽  
Performance Analysis ◽  
Stakeholder Analysis ◽  
Forest Resources ◽  
Forest Resource ◽  
Joint Forest Management ◽  
Average Income ◽  
Community Based ◽  
Forest Functions ◽  
High Level

Community-based forest management (CBFM) was aimed to achieve the sustainability of forest functions and to omptimize its benefits. CBFM around the Forest Lap Area in North Bandung is a joint forest management between Perum Perhutani and forest villagers. The purposes of this study were; (1) to analyse the processes and stakeholders of CBFM, (2) to analyse the institution effectiveness of CBFM, (3) to analyse the result of the CBFM implementation The approach of this research was the stakeholder analysis and IPA (importance of Performance Analysis). The result of stakeholder mapping showed that Perum Perhutani and LMDH had the role in the implementation of CBFM system. The results of the economic impact of CBFM calculations indicated that the system could increase the income of MDH. This was indicated by the change in the average income of farmers by 63%. The result of IPA could be seen from the mapping of availability level of forest resources and forest resource need for the community included in B quadran in which it had a high level of availability and interest.

Appraisal, Coping and High Level Emotions Aspects of Computational Emotional Thinking

2015 ◽  
Vol 6 (1) ◽  
pp. 24-39 ◽  
Author(s):  
Max Talanov ◽  
Alexander Toschev
Keyword(s):  
Evolutionary Psychology ◽  
Emotional Response ◽  
Emotional State ◽  
Current Work ◽  
Computing Systems ◽  
Intelligent Machines ◽  
Thinking Processes ◽  
High Level ◽  
Computational Processes ◽  
The Way

Turing genius anticipated current research in AI field for 65 years and stated that idea of intelligent machines “cannot be wholly ignored, because the idea of 'intelligence' is itself emotional rather than mathematical” (). This is the second article dedicated to emotional thinking bases. In the first article, the authors () created overall picture and proposed framework for computational emotional thinking. They used 3 bases for their work: AI - six thinking levels model described in book “The emotion machine” (). Evolutionary psychology model: “Wheel of emotions” (). Neuroscience (neurotransmission) theory of emotions by Lovheim “Cube of emotions” (). Based on neurotransmitters impact the authors proposed to model emotional computing systems. Current work is dedicated to three aspects left not described in first article: appraisal: algorithm and predicates - how inbound stimulus is estimated to trigger proper emotional response, coping: the way human treat with emotional state triggered by stimulus appraisal and further thinking processes, high level emotions impact on system and its computational processes.

High-level application-specific performance analysis using the G-PM tool

2008 ◽  
Vol 24 (2) ◽  
pp. 121-132 ◽  
Author(s):  
Roland Wismüller ◽  
Marian Bubak ◽  
Włodzimierz Funika
Keyword(s):  
Performance Analysis ◽  
Specific Performance ◽  
High Level ◽  
Application Specific

scholarly journals PAEAN: Portable and scalable runtime support for parallel Haskell dialects

2016 ◽  
Vol 26 ◽  
Author(s):  
JOST BERTHOLD ◽  
HANS-WOLFGANG LOIDL ◽  
KEVIN HAMMOND
Keyword(s):  
Shared Memory ◽  
High Performance ◽  
Parallel Machines ◽  
State Of The Art ◽  
Computing Systems ◽  
Programming Abstraction ◽  
Work Distribution ◽  
High Level ◽  
Parallelism Model ◽  
Performance Computing

AbstractOver time, several competing approaches to parallel Haskell programming have emerged. Different approaches support parallelism at various different scales, ranging from small multicores to massively parallel high-performance computing systems. They also provide varying degrees of control, ranging from completely implicit approaches to ones providing full programmer control. Most current designs assume a shared memory model at the programmer, implementation and hardware levels. This is, however, becoming increasingly divorced from the reality at the hardware level. It also imposes significant unwanted runtime overheads in the form of garbage collection synchronisation etc. What is needed is an easy way to abstract over the implementation and hardware levels, while presenting a simple parallelism model to the programmer. The PArallEl shAred Nothing runtime system design aims to provide a portable and high-level shared-nothing implementation platform for parallel Haskell dialects. It abstracts over major issues such as work distribution and data serialisation, consolidating existing, successful designs into a single framework. It also provides an optional virtual shared-memory programming abstraction for (possibly) shared-nothing parallel machines, such as modern multicore/manycore architectures or cluster/cloud computing systems. It builds on, unifies and extends, existing well-developed support for shared-memory parallelism that is provided by the widely used GHC Haskell compiler. This paper summarises the state-of-the-art in shared-nothing parallel Haskell implementations, introduces the PArallEl shAred Nothing abstractions, shows how they can be used to implement three distinct parallel Haskell dialects, and demonstrates that good scalability can be obtained on recent parallel machines.

Sign in / Sign up

Export Citation Format

Share Document