نتایج جستجو برای: critical section

تعداد نتایج: 628354  

Journal: :Inf. Process. Lett. 2001
Vicent Cholvi Pablo Boronat

A fundamental issue in the development of concurrent programs is the resource allocation problem. Roughly speaking, it consists of providing some mechanism to avoid race conditions in the access of shared resources by two or more concurrent processes. For such a task, maybe the most widely mechanism consists of using critical sections. Unfortunately, it is also widely-known that programs which ...

1995
Tord Riemann

At LEP 1, cross sections and cross section asymmetries may be analysed model independently. Cross sections depend on four, asymmetries on two free parameters. As an example, I discuss the model independent Z boson mass determination from the Z line shape and compare it to the Standard Model approach.

1994
Abigail S. Gertner

The e ective communication of information is an important concern in the design of an expert consultation system. Several researchers have chosen to adopt a critiquing mode, in which the system evaluates and reacts to a solution proposed by the user rather than presenting its own solution. In this proposal, I present an architecture for a critiquing system that functions in real-time, during th...

2014
Martin D. Schwarz Helmut Seidl Vesal Vojdani Kalmer Apinis

Although priority scheduling in concurrent programs provides a clean way of synchronization, developers still additionally rely on hand-crafted schemes based on integer variables to protect critical sections. We identify a set of sufficient conditions for variables to serve this purpose. We provide efficient methods to verify these conditions, which enable us to construct an enhanced analysis o...

2017
Lechanceux Luhunu Eugene Syriani

Among the various model-to-text transformation paradigms, template-based code generation (TBCG) is the most popular in MDE. Given the diversity of tools and approaches, it is necessary to classify and compare existing TBCG techniques to provide appropriate support to developers. We conduct a systematic mapping study of the literature to better understand the trends and characteristics of TBCG t...

2002
Philip Holman James H. Anderson

We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The rst class is only applicable in systems in which all critical sections are short relative to the length of the scheduling quantum. In this case, e cient synchronization can be achieved by ensuring that all locks have ...

2017
Scott Cadzow

In recognising that it is the human factor that generally identifies risk and maps out the functionality of a system its goal in other words it is clear that this strength can be undermined by fallibility. The question we need to ask is how do we optimise the strengths of the human element and minimise the risk they present to the system? How do we do the security job effectively without leadin...

2002
J. M. Sancho

Stochastic processes defined by a general Langevin equation of motion where the noise is the nonGaussian dichotomous Markov noise are studied. A non-Fokker-Planck master differential equation is deduced for the probability density of these processes. Two different models are exactly solved. In the second one, a nonequilibrium bimodal distribution induced by the noise is observed for a critical ...

2016
Chien-Chung Huang Prasad Jayanti

Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of this problem, which we call priority mutual exclusion, processes have priorities and the requirement is that, whenever the critical section becomes vacant, the next occupant should be the process that has the highest priority among the waiting processes. Instead of first capturing this vague, but in...

1998
Kevin M. Lynch Naoji Shiroma Hirohiko Arai Kazuo Tanie

This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane with a passive revolute third joint. Such a robot is small-time locallycontrollableon an open subset of its zero velocity section, allowing it to follow any path in this subset arbitrarily closely. However, some paths are “preferred” by the dynamics of the manipulator in that...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید