Jan Henry Nystrom
ABSTRACT
This paper provides an introduction to the finer points of priority based message reception. A new behaviour is devised to provide a generic server that does priority based message reception.
The combination of generic finite state machines and prioritised is also discussed.
Finally it is demonstrated how behaviours could be significantly strengthened in usefulness by allowing the behaviour info to specify that a parse transform. An Erlang Extension Proposal suggesting the change is included in the appendices.
- J. Armstrong. Programming Erlang - Software for a Concurrent World. Pragmatic Programmer, 2007. Google Scholar
Digital Library
- J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Programming in ERLANG. Prentice Hall, 2nd edition, 1996. Google ScholarDigital Library
Index Terms
- Priority messaging made easy
Recommendations
Erlang behaviours: programming with process design patterns
CEFP'09: Proceedings of the Third summer school conference on Central European functional programming schoolErlang processes run independently of each other, each using separate memory and communicating with each other by message passing. These processes, while executing different code, do so following a number of common patterns. By examining different ...
The impact of priority generations in a multi-priority queueing system: a simulation approach
WSC '09: Winter Simulation ConferenceIn this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability pi. The highest priority, ...
An N-Server Cutoff Priority Queue
We consider a multi-priority, nonpreemptive, multi-server queueing system, with Poisson arrivals and negative exponential service times. In order to save available servers for higher priority customers, the system deliberately queues arriving lower ...
Comments