Not handling signals degrades performance

Signals are asynchronous software interrupts that usually happen due to users or utilities sending signals to processes, hardware exceptions within applications, and conditional statements within applications. Most applications do not handle signals because programmers are told "error checking" means checking return values, e.g. does a function return 0 or -1?

When an application doesn't handle signals, it relies on the kernel to do what it thinks is best for an application and the application's data after an error occurs. Sometimes an error is returned to the user, other times the problem is ignored. That's because kernels react to categorized errors, not to specifc errors caused by every imaginable application.

Some interesting and hard to find performance issues arise when applications do not handle signals, such as an accumulation of lost i-nodes, race conditions between statements, random data corruption and other unexpected behavior. A lot of performance issues are avoidable by assigning default actions to caught signals.

I think the biggest problem with handling signals is portability. The number and type of signals available vary across operating systems. For example, most Linux operating systems do not have a default value assigned to the NULL signal and have between 1 and 31 signals. Whereas, Unix has a default value of 0 assigned to the NULL signal and can have more than 255 signals.

Do you have a suggestion about how to improve this blog? Let's talk about it. Contact me at David.Brenner.Jr@Gmail.com or 720-584-5229.

Comments

OpenStack+Ceph as Software-Defined Storage

SDS reduces the costs of the management of growing data stores by decoupling storage management from its hardware to allow for centralized management of cheaper, popular commodity hardware. The example SDS ecosystem uses open source software like OpenStack as a front-end interface on top of Ceph as the resource provider of a RADOS cluster of commodity solid-state drives. OpenStack provides user-friendly wrappers for accessing and modifying underlying Ceph storage. OpenStack comes in the form of distributed microservices with RESTful API's: Block (Cinder), File (Manila), Image (Glance), and Object (Swift). Each microservice can scale-out as a cluster of stand-alone services to accommodate the varying demands of high-growth storage. With OpenStack the underlying Ceph storage can address the block storage needs, file storage needs, image storage needs, and object storage needs of datacenters adopting open source as their new norm in an industry trend for high performace and high a...

The meaning of time in reinforcement learning

Reinforcement learning (RL) is one of three basic machine learning paradigms, alongside supervised learning and unsupervised learning. Reinforcement learning is concerned with how software agents ought to take actions in an environment in order to maximize the notion of cumulative reward through the process of trial and error. In reinforcement learning an agent starts at an empty state then analyzes the available datasets according to a policy of positive states and negative states. Rather than being explicitly taught as in supervised learning the correct set of actions for performing a task, reinforcement learning uses rewards as signals for positive states and punishments as signals for negative states. The agent obtains the best path to a desirable reward as a cumulation of positive states and negative states. As compared to unsupervised learning, reinforcement learning is different in terms of goals. While the goal in unsupervised learning is to find similarities and differences...

Principal Component Analysis

Principal Component Analysis (PCA) is a common technique in statistical analysis, widely used for pattern recognition, data compression, image preprocessing, signal-noise analysis, and high resolution spectrum analysis. Principal Component Analysis transforms a group of activites into a set of unique components, where each component has a numerical degree of distance and relatedness from an agreed on centered component. The first component has the largest possible variance (it accounts for most of the variability in the group). Each succeeding component has the highest variance that is orthogonal to the preceding components. The transformation of the group proceeds linearly from a group with a high degree of dimensionality to a group with a low degree of dimensionality of which the components of the group with a low degree of dimensionality are uncorrelated. Principal Component Analysis is also used in the forecast of a most likely outcome through time-series analysis and regress...

David Brenner Jr's Random Things

Search This Blog