Restricted permutations and queue jumping
نویسندگان
چکیده
A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding both 4231 and 42513, and enumeration results for such permutations are given.
منابع مشابه
A SINGLE SERVER BERNOULLI VACATION QUEUE WITH TWO TYPE OF SERVICES AND WITH RESTRICTED ADMISSIBILITY
A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...
متن کاملBoolean Circuits, Tensor Ranks, and Communication Complexity
We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. Our methods are combinatorial, but we think that our main contribution concerns the algebraic concepts used in this area (tensor ranks and rigidit...
متن کاملEnumerative aspects of certain subclasses of perfect graphs
We investigate the enumerative aspects of various classes of perfect graphs like cographs, split graphs, trivially perfect graphs and threshold graphs. For subclasses of permutation graphs like cographs and threshold graphs we also determine the number of permutations of f1; 2; : : : ; ng such that the permutation graph G] belongs to that class. We establish an interesting bijec-tion between pe...
متن کاملPermutations sortable by deques and by two stacks in parallel
In his seminal work The Art of Computer Programming [2], Knuth was the first to consider a number of classic data structures from the point of view of the permutations they could produce from the identity permutation, or equinumerously, the permutations which the data structure can sort. Famously, he noticed that the permutations obtainable using a single stack are exactly those which avoid the...
متن کاملPerformance comparison of several priority schemes with priority jumps
In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arrive in separate queues, i.e., the highand low-priority queue respectively. In order to deal with possibly excessive delays however, non-real-time packets in the low-priority queue can in the course of time jump to the h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 287 شماره
صفحات -
تاریخ انتشار 2004