“A Labour Leader in a Frothy Scoundrel”: Farce and Social Justice in the Popular Dramaturgy of George Shiels

In the financially precarious period which followed the partition of Ireland (1922) the Northern Irish playwright George Shiels kept The Abbey Theatre, Dublin, open for business with a series of ‘box-office’ successes. Literary Dublin was not so appreciative of his work as the Abbey audiences dubbing his popular dramaturgy mere ‘kitchen comedy’. However, recent analysts of Irish theatre are beginning to recognise that Shiels used popular theatre methods to illuminate and interrogate instances of social injustice both north and south of the Irish border. In doing so, such commentators have set up a hierarchy between the playwright’s early ‘inferior’ comedies and his later ‘superior’ works of Irish Realism. This article rejects this binary by suggesting that in this early work Shiels’s intent is equally socially critical and that in the plays Paul Twyning, Professor Tim and The Retrievers he is actively engaging with the farcical tradition in order to expose the marginalisation of the landless classes in Ireland in the post-colonial jurisdictions.

Voices from higher up the ladder:Exploring the team leader role in call centres

This paper focuses on an under-researched employee category in the call centre literature-the team leader. The paper, drawing on data from nine Australian call centres, finds that the team leader role is integral to the effectiveness of call centres, yet it is a role that consists of considerable complexity and contradictions. The research demonstrates the critical role performed by team leaders: coach, mentor, trainer, performance evaluator, communicator and supervisor. It also shows team leaders as being far more positive about many of the features of the call centre work environment compared with those on the front line. However, there does appear to be a need for greater acknowledgement of their challenging role, the contradictions that are inherent in the job and the need, in many cases, for increased support being made available to assist. © 2013 John Wiley & Sons Ltd.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.