scholarly journals Some preliminary results of memory cache analysis with the use of non-extensive

2017 ◽  
Vol 16 (2) ◽  
pp. 43
Author(s):  
Dominik Strzałka
Keyword(s):  
Operating Systems ◽  
Computer Systems ◽  
Memory Systems ◽  
Cache Memory ◽  
Preliminary Results ◽  
Memory Cache ◽  
Statistical Behavior ◽  
And Performance ◽  
Inherent Part ◽  
Different Parts

<p>The problem of modeling different parts of computer systems requires accurate statistical tools. Cache memory systems is an inherent part of nowadays computer systems, where the memory hierarchical structure plays a key point role in behavior and performance of the whole system. In the case of Windows operating systems, cache memory is a place in memory subsystem where the I/O system puts recently used data from disk. In paper some preliminary results about statistical behavior of one selected system counter behavior are presented. Obtained results shown that the real phenomena, which have appeared during human-computer interaction, can be expressed in terms of non-extensive statistics that is related to Tsallis proposal of new entropy definition.</p>

scholarly journals MESI Cache Coherence Simulator for Teaching Purposes

2009 ◽  
Vol 12 (1) ◽  
Author(s):  
Juan Gómez-Luna ◽  
Ezequiel Herruzo ◽  
José Ignacio Benavides
Keyword(s):  
Cache Coherence ◽  
Computer Systems ◽  
Memory Systems ◽  
Memory System ◽  
Experimental Results ◽  
Cache Memory ◽  
Memory Location ◽  
Memory Coherence ◽  
Computational Systems ◽  
Short Explanation

Nowadays, the computational systems (multi and uniprocessors) need to avoid the cachecoherence problem. There are some techniques to solve this problem. The MESI cachecoherence protocol is one of them. This paper presents a simulator of the MESI protocolwhich is used for teaching the cache memory coherence on the computer systems withhierarchical memory system and for explaining the process of the cache memory location inmultilevel cache memory systems. The paper shows a description of the course in which thesimulator is used, a short explanation about the MESI protocol and how the simulatorworks. Then, some experimental results in a real teaching environment are described.

scholarly journals A Model-Based Approach for Adaptable Middleware Evolution in WSN Platforms

2021 ◽  
Vol 10 (1) ◽  
pp. 20
Author(s):  
Walter Tiberti ◽  
Dajana Cassioli ◽  
Antinisca Di Marco ◽  
Luigi Pomante ◽  
Marco Santic
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Embedded System ◽  
Operating Systems ◽  
Parallel Evolution ◽  
Wireless Sensor ◽  
New Techniques ◽  
Model Based ◽  
And Performance ◽  
Hardware Platforms

Advances in technology call for a parallel evolution in the software. New techniques are needed to support this dynamism, to track and guide its evolution process. This applies especially in the field of embedded systems, and certainly in Wireless Sensor Networks (WSNs), where hardware platforms and software environments change very quickly. Commonly, operating systems play a key role in the development process of any application. The most used operating system in WSNs is TinyOS, currently at its TinyOS 2.1.2 version. The evolution from TinyOS 1.x and TinyOS 2.x made the applications developed on TinyOS 1.x obsolete. In other words, these applications are not compatible out-of-the-box with TinyOS 2.x and require a porting action. In this paper, we discuss on the porting of embedded system (i.e., Wireless Sensor Networks) applications in response to operating systems’ evolution. In particular, using a model-based approach, we report the porting we did of Agilla, a Mobile-Agent Middleware (MAMW) for WSNs, on TinyOS 2.x, which we refer to as Agilla 2. We also provide a comparative analysis about the characteristics of Agilla 2 versus Agilla. The proposed Agilla 2 is compatible with TinyOS 2.x, has full capabilities and provides new features, as shown by the maintainability and performance measurement presented in this paper. An additional valuable result is the architectural modeling of Agilla and Agilla 2, missing before, which extends its documentation and improves its maintainability.

1 Effect of Conditioning, Rest, and Post-rest Transport Duration on Welfare Indicators of Beef Cattle Transported by Road

2021 ◽  
Vol 99 (Supplement_3) ◽  
pp. 2-3
Author(s):  
Daniela M Melendez ◽  
Sonia Marti ◽  
Timothy D Schwinghamer ◽  
Derek B Haley ◽  
Karen S Schwartzkopf-Genswein
Keyword(s):  
Beef Cattle ◽  
Factorial Design ◽  
Random Effects ◽  
Fixed Effects ◽  
Rest Period ◽  
Flight Speed ◽  
Beef Calves ◽  
Welfare Indicators ◽  
Preliminary Results ◽  
And Performance

Abstract The aim of this study was to assess the effects of conditioning, rest, and post-rest transport duration on welfare indicators of 6–7 mo old beef calves. Three hundred and twenty-eight weaned calves (237 ± 29.7 kg BW) were randomly assigned to a 2 × 2 × 2 nested factorial design: conditioning, conditioned (C) or non-conditioned (N); rest, 0 (R0) or 8 (R8) h, and post-rest transport, 4 (T4) or 15 (T15) h. Calves were sampled prior to the first loading (L1), after 20h of transport, prior to and after the additional 4 or 15-h transport, and at 1, 2, 3, 5, 14, and 28 d after transport ended. Data were analyzed using the GLIMMIX procedure of SAS. Fixed effects included conditioning, transport and time nested within rest period, while random effects included animal and pen. Greater shrink (P &lt; 0.01) was observed in C than N calves after the initial 20-h transport. The N calves had greater (P &lt; 0.01) ADG than C calves between L1 and d 5, while C had greater (P &lt; 0.01) ADG than N calves between 14 and 28 d. L-lactate concentrations and flight speed were greater (P ≤ 0.05) in C than N calves between L1 and d 5. The R8-T4 calves had greater (P &lt; 0.01) ADG than R8-T15 calves between L1 and d 5. The R0-T4 calves had greater (P = 0.02) L-lactate concentrations than R0-T15 and R8-T4 calves on d 1. The R0 calves had greater (P &lt; 0.01) ADG than R8 calves between 14 and 28 d. Preliminary results show physiological, behavioral, and performance differences across treatments, however, additional indicators are required to accurately assess the effect of conditioning, rest, and post-rest transport durations on calf welfare.

scholarly journals Data-driven Adaptive Thresholding Model for Real-time Valve Delay Estimation in Digital Pump/Motors

2020 ◽  
Author(s):  
Abdallah Chehade ◽  
Farid Breidi ◽  
Keith Scott Pate ◽  
John Lumkes
Keyword(s):  
High Pressure ◽  
Real Time ◽  
Domain Knowledge ◽  
Operating Conditions ◽  
Delay Model ◽  
Hydraulic Systems ◽  
Pressure Transducers ◽  
Statistical Behavior ◽  
Shift Detection ◽  
And Performance

Valve characteristics are an essential part of digital hydraulics. The on/off solenoid valves utilized on many of these systems can significantly affect the performance. Various factors can affect the speed of the valves causing them to experience various delays, which impact the overall performance of hydraulic systems. This work presents the development of an adaptive statistical based thresholding real-time valve delay model for digital Pump/Motors. The proposed method actively measures the valve delays in real-time and adapts the threshold of the system with the goal of improving the overall efficiency and performance of the system. This work builds on previous work by evaluating an alternative method used to detect valve delays in real-time. The method used here is a shift detection method for the pressure signals that utilizes domain knowledge and the system’s historical statistical behavior. This allows the model to be used over a large range of operating conditions, since the model can learn patterns and adapt to various operating conditions using domain knowledge and statistical behavior. A hydraulic circuit was built to measure the delay time experienced from the time the signal is sent to the valve to the time that the valve opens. Experiments were conducted on a three piston in-line digital pump/motor with 2 valves per cylinder, at low and high pressure ports, for a total of six valves. Two high frequency pressure transducers were used in this circuit to measure and analyze the differential pressure on the low and high pressure side of the on/off valves, as well as three in-cylinder pressure transducers. Data over 60 cycles was acquired to analyze the model against real time valve delays. The results show that the algorithm was successful in adapting the threshold for real time valve delays and accurately measuring the valve delays. 

scholarly journals The Impact of Operating System on Bandwidth in Open VPN Technology

2016 ◽  
Vol 13 (1) ◽  
pp. 204-211
Author(s):  
Baghdad Science Journal
Keyword(s):  
Operating System ◽  
Operating Systems ◽  
Data Privacy ◽  
The Internet ◽  
Sensitive Data ◽  
Privacy And Security ◽  
Basic Source ◽  
Basic Functions ◽  
And Performance ◽  
The Impact

The internet is a basic source of information for many specialities and uses. Such information includes sensitive data whose retrieval has been one of the basic functions of the internet. In order to protect the information from falling into the hands of an intruder, a VPN has been established. Through VPN, data privacy and security can be provided. Two main technologies of VPN are to be discussed; IPSec and Open VPN. The complexity of IPSec makes the OpenVPN the best due to the latter’s portability and flexibility to use in many operating systems. In the LAN, VPN can be implemented through Open VPN to establish a double privacy layer(privacy inside privacy). The specific subnet will be used in this paper. The key and certificate will be generated by the server. An authentication and key exchange will be based on standard protocol SSL/TLS. Various operating systems from open source and windows will be used. Each operating system uses a different hardware specification. Tools such as tcpdump and jperf will be used to verify and measure the connectivity and performance. OpenVPN in the LAN is based on the type of operating system, portability and straightforward implementation. The bandwidth which is captured in this experiment is influenced by the operating system rather than the memory and capacity of the hard disk. Relationship and interoperability between each peer and server will be discussed. At the same time privacy for the user in the LAN can be introduced with a minimum specification.

scholarly journals The Impact of Perceived Subgroup Formation on Transactive Memory Systems and Performance in Distributed Teams

2016 ◽  
Vol 12 (1) ◽  
pp. 44-66 ◽  
Author(s):  
Yide Shen ◽  
Michael J. Gallivan ◽  
Xinlin Tang
Keyword(s):  
Team Performance ◽  
Memory Systems ◽  
Transactive Memory ◽  
Distributed Teams ◽  
Future Research ◽  
Negative Effect ◽  
Group Members ◽  
And Performance ◽  
Using Data ◽  
The Impact

With distributed teams becoming increasingly common in organizations, improving their performance is a critical challenge for both practitioners and researchers. This research examines how group members' perception of subgroup formation affects team performance in fully distributed teams. The authors propose that individual members' perception about the presence of subgroups within the team has a negative effect on team performance, which manifests itself through decreases in a team's transactive memory system (TMS). Using data from 154 members of 41 fully distributed teams (where no group members were colocated), the authors found that members' perceptions of the existence of subgroups impair the team's TMS and its overall performance. They found these effects to be statistically significant. In addition, decreases in a group's TMS partially mediate the effect of perceived subgroup formation on team performance. The authors discuss the implications of their findings for managerial action, as well as for researchers, and they propose directions for future research.

APPLICATION OF PERFORMANCE REDUCTION METHODS FOR MINIMIZATION OF ANALYZED NUMBER OF PARALLEL PROGRAM VARIANTS

2019 ◽  
pp. 43-49 ◽  
Author(s):  
A. I. Dordopulo
Keyword(s):  
Computer Systems ◽  
Automatic Parallelization ◽  
Parallel Program ◽  
Parallel Applications ◽  
Performance Reduction ◽  
Reduction Methods ◽  
And Performance ◽  
Hardware Costs ◽  
Sequential Reduction ◽  
Information Graph

In this paper, we review and compare the methods of parallel applications’ development based on the automatic program parallelizing for computer systems with shared and distributed memory and on the information graph’s hardware costs and performance reduction for reconfigurable computer systems. The increase in the number of computer system’s units or in the problem’s dimension leads to the significant growth of the automatic parallelization complexity for a procedural program. As a result, the obtainment of parallelizing results in acceptable time using state-of-the-art computer systems is very problematic. In reconfigurable computer systems, the reduction of absolutely parallel information graph of a problem is applied for the parallel program creation. The information graph illustrates the parallelizing and pipelining of computations. In addition to the traditionally practiced reduction of basic subgraphs’ number, the reductions of computational operations’ quantity and of data digit capacity can be utilized for the performance or hardware costs’ scaling. We have proved that the methods of information graph hardware costs and performance reduction provide a considerable decrease in the number of steps needed for adaptation of parallel application to reconfigurable computer systems’ architectures in comparison with automatic parallelizing. We have proved the theorem of coefficient value at sequential reduction, the theorem of increase in reduction coefficient at custom value and the theorem of commutativity of various reduction transformations. The proved theorems help to find a rational sequence of reduction transformations.

Sign in / Sign up

Export Citation Format

Share Document