scispace - formally typeset
Topic

Blocking (computing)

About: Blocking (computing) is a(n) research topic. Over the lifetime, 889 publication(s) have been published within this topic receiving 14754 citation(s).

...read more

Papers
  More

Journal ArticleDOI: 10.1109/TCOM.1981.1094894
J. Kaufman1Institutions (1)
Abstract: In recent years, considerable effort has focused on evaluating the blocking experienced by "customers" in contending for a commonly shared "resource." The customers and resource in question have typically been messages and storage space in message storage applications or data streams and bandwidth in data multiplexing applications. The model employed in these studies, a multidimensional generalization of the classical Erlang loss model, has been limited to exponentially distributed storage (or data transmission) times, questions concerning efficient computational schemes have largely been ignored, and the class of resource sharing policies considered has been unnecessarily restricted. The contribution of this paper is threefold. We first show that the state distribution (obtained by previous authors) is valid for the large class of residency time distributions which have rational Laplace transforms. Second, we show that, for the important and commonly implemented policy of complete sharing, a simple one-dimensional recursion can be developed which eliminates all difficulty in computing quantities of interest-regardless of both the size and dimensionality of the underlying model. Third, we show that the state distribution holds for completely arbitrary resource sharing policies.

...read more

Topics: Shared resource (54%), Blocking (computing) (53%), Erlang (unit) (51%) ...read more

1,005 Citations


Proceedings ArticleDOI: 10.1145/1065944.1065952
15 Jun 2005-
Abstract: Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is that even correctly-implemented concurrency abstractions cannot be composed together to form larger abstractions. In this paper we present a new concurrency model, based on transactional memory, that offers far richer composition. All the usual benefits of transactional memory are present (e.g. freedom from deadlock), but in addition we describe new modular forms of blocking and choice that have been inaccessible in earlier work.

...read more

803 Citations


Journal ArticleDOI: 10.1287/OPRE.44.3.510
Abstract: An important class of machine scheduling problems is characterized by a no-wait or blocking production environment, where there is no intermediate buffer between machines. In a no-wait environment, a job must be processed from start to completion, without any interruption either on or between machines. Blocking occurs when a job, having completed processing on a machine, remains on the machine until a downstream machine becomes available for processing. A no-wait or blocking production environment typically arises from characteristics of the processing technology itself, or from the absence of storage capacity between operations of a job. In this review paper, we describe several well-documented applications of no-wait and blocking scheduling models and illustrate some ways in which the increasing use of modern manufacturing methods gives rise to other applications. We review the computational complexity of a wide variety of no-wait and blocking scheduling problems and describe several problems which remain open as to complexity. We study several deterministic flowshop, jobshop, and openshop problems and describe efficient and enumerative algorithms, as well as heuristics and results about their performance. The literature on stochastic no-wait and blocking scheduling problems is also reviewed. Finally, we provide some suggestions for future research directions.

...read more

Topics: Flow shop scheduling (61%), Job shop (59%), Blocking (computing) (59%) ...read more

785 Citations


Journal ArticleDOI: 10.1109/TSMCA.2003.820590
Maria Pia Fanti, MengChu Zhou1Institutions (1)
01 Jan 2004-
Abstract: As more and more producers move to use flexible and agile manufacturing as a way to keep them with a competitive edge, the investigations on deadlock resolution in automated manufacturing have received significant attention for a decade. Deadlock and related blocking phenomena often lead to catastrophic results in automated manufacturing systems. Their efficient handling becomes a necessary condition for a system to gain high productivity. This paper intends to present a tutorial survey of state-of-the art modeling and deadlock control methods for discrete manufacturing systems. It presents the updated results in the areas of deadlock prevention, detection and recovery, and avoidance. It focuses on three modeling methods: digraphs, automata, and Petri nets. Moreover, for each approach, the main and relevant contributions are selected enlightening pros and cons. The paper concludes with the future research needs in this important area in order to bridge the gap between the academic research and industrial needs.

...read more

Topics: Deadlock prevention algorithms (68%), Deadlock (63%), Agile manufacturing (59%) ...read more

320 Citations


Journal ArticleDOI: 10.1002/J.1538-7305.1985.TB00038.X
Ward Whitt1Institutions (1)
Abstract: This paper analyzes a mathematical model of a blocking system with simultaneous resource possession. There are several multiserver service facilities without extra waiting space at which several classes of customers arrive in independent Poisson processes. Each customer requests service from one server in each facility in a subset of the service facilities, with the subset depending on the customer class. If service can be provided immediately upon arrival at all required facilities, then service begins and all servers assigned to the customer start and finish together. Otherwise, the attempt is blocked (lost without generating retrials). The problem is to determine the blocking probability for each customer class. An exact expression is available, but it is complicated. Hence, this paper investigates approximation schemes.

...read more

Topics: Service (business) (57%), Blocking (computing) (53%), Server (51%)

283 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
202143
202042
201943
201833
201736

Top Attributes

Show by:

Topic's top 5 most impactful authors

Kalyan S. Perumalla

4 papers, 37 citations

Francesco Quaglia

4 papers, 62 citations

Ahcene Bendjoudi

4 papers, 29 citations

Margarethe Zmuda

4 papers, 93 citations

Paul D. Ezhilchelvan

4 papers, 25 citations