The paper offers an introduction and a road map to the burgeoning literature on two-sided markets. In many industries, platforms court two (or more) sides that use the platform to interact with each other. The platforms’ usage or variable charges impact the two sides’ willingness to trade, and thereby their net surpluses from potential interactions; the platforms’ membership or fixed charges in...

This paper describes an algorithm that achieves delay and throughput decoupling in distributed fair scheduling in multihop ad-hoc wireless networks. The solution allows to support both low-bandwidth, low-delay and high-bandwidth, high delay applications in a single framework, without wasting much bandwidth to realize the low-delay requirement. We demonstrate the effectiveness of our algorithm i...

A lot of work has been done addressing issues of fair scheduling in wireline packet networks. Most techniques developed have not effectively address the unique constraints post by a wireless packet network. This report reviews [1], a paper which proposes a model for wireless packet network fair scheduling and provides a protocol that attempts to implement such a model.

It is widely recognized that a Share Economy (SE) Pareto-dominates a FixedWage Economy (FWE) if unions care about employment. This begs the question, why profit sharing is less than ubiquitous. In this paper, we offer a solution to this conundrum by looking at particular transition arrangements from a FWE to a SE. We analytically show that despite the Pareto-dominance of a SE, the changeover fr...

We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mechanism allows the scheduler to make more efficient decisions about which jobs and users to prioritize and gives users the tool to optimize and customize their allocations to fit the importance and requirements of their...

The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a runtim...

This thesis analyzes and compares four different mechanisms for providing QoS in IEEE 802.11 wireless LANs. We have evaluated the Point Coordinator Function (which is the IEEE 802.11 mode for service differentiation), Distributed Fair Scheduling, Blackburst, and a scheme proposed by Deng et al. using the ns-2 simulator. The evaluation covers medium utilization, access delay, and the ability to ...

The paper considers whether ‘fair share capitalism’ improves workplace productivity. ‘Fair share capitalism’ (FSC) is a generic term for the financial mechanism that links employees’ pay to group or company performance. The traditional rationale for FSC is that where employers find it difficult or costly to monitor inputs they will choose to pay for outputs. FSC can then be used to align worker...

I MOHAMMED.A.F, and L A S L D.: 'High resolution techniques for Loran-C skywavedelayc?timation', Elecrmn. Len., 1999.35, (18J,pp. 1516-1517 2 MOHAMMFII.A.F., and LAST, J.D.: 'Loran-C skywave delay drtcction using ARMA algorithm', Eleefmn. Le//., 1998, 34, (17). pp. 16561655 3 MOHAMMED. A F . , and LAST, 111: 'Loran-C skywave delay estimation using the AR algorithm', Eleceon. Len, 1998, 34, (23)...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...