scholarly journals Balanced allocation on graphs

Author(s):  
Krishnaram Kenthapadi ◽  
Rina Panigrahy
Keyword(s):  
2017 ◽  
Vol 49 (2) ◽  
pp. 603-628 ◽  
Author(s):  
Ramtin Pedarsani ◽  
Jean Walrand ◽  
Yuan Zhong

Abstract Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e. policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper we propose a general framework for the design of robust policies. The main technical novelty is the use of a stochastic gradient projection method that reacts to queue-length changes in order to find a balanced allocation of service resources to incoming tasks. We illustrate our approach on two broad classes of processing systems, namely the flexible fork-join networks and the flexible queueing networks, and prove the rate stability of our proposed policies for these networks under nonrestrictive assumptions.


Author(s):  
Hideaki Ohashi ◽  
Yasuhito Asano ◽  
Toshiyuki Shimizu ◽  
Masatoshi Yoshikawa
Keyword(s):  

2021 ◽  
Vol 13 (1) ◽  
pp. 338-373
Author(s):  
Tommy Andersson ◽  
Ágnes Cseh ◽  
Lars Ehlers ◽  
Albin Erlanson

This paper considers time exchanges via a common platform (e.g., markets for exchanging time units, positions at education institutions, and tuition waivers). There are several problems associated with such markets, e.g., imbalanced outcomes, coordination problems, and inefficiencies. We model time exchanges as matching markets and construct a non-manipulable mechanism that selects an individually rational and balanced allocation that maximizes exchanges among the participating agents (and those allocations are efficient). This mechanism works on a preference domain whereby agents classify the goods provided by other participating agents as either unacceptable or acceptable, and for goods classified as acceptable, agents have specific upper quotas representing their maximum needs. (JEL C78, D47, D82)


2008 ◽  
Vol 45 (3) ◽  
pp. 284-288 ◽  
Author(s):  
Charlotte Prahl ◽  
Birte Prahl-Andersen ◽  
Martin A. Van't Hof ◽  
Anne M. Kuijpers-Jagtman

Objective: To study the effect of infant orthopedics on satisfaction in motherhood. Design: Prospective two-arm randomized controlled trial in parallel with three participating academic cleft palate centers. Treatment allocation was concealed and was performed by means of a computerized balanced allocation method. Setting: Cleft palate centers of Amsterdam, Nijmegen, and Rotterdam, the Netherlands. Patients: Two groups of infants with complete unilateral cleft lip and palate and no other malformations. Interventions: Group IO+ (n  =  27) wore passive maxillary plates during the first year of life, group IO− (n  =  27) did not. Main Outcome Measure(s): Mean satisfaction scores were obtained from completed questionnaires at 6, 24, and 58 weeks of age. A 4-point scale was used (1  =  very satisfactory to 4  =  very unsatisfactory). Results: The range of the mean scores for the individual items on the questionnaires for both groups ranged between 1.1 and 2.4. No differences were found between groups. Mothers appear to be satisfied in motherhood, least satisfied with the available time for themselves, and very satisfied with hugging and walking their babies. No differences were found between groups. Conclusions: Results from the present study show that infant orthopedics, with a passive plate during the first year of life, in children with a unilateral cleft lip and palate has no influence on the mothers’ satisfaction in motherhood.


2013 ◽  
Vol 441 ◽  
pp. 602-606
Author(s):  
Wei Jun Pan ◽  
Wen Bin Qiu ◽  
Rui Kang

A nonlinear integer programming model (NIPM) with constraints is proposed to solve the allocation of approach flight flow where ends with terminal airspace, an example of an airport terminal airspace is given, where the flow is accurately forecasted.Analysising flight delays, theres a conclusion: the results solved by NIPM is far better than the average allocation method, for the second-level airspace, NIPM can reduce two flight delays, and the allocation in each flight route tends to be equilibrium, NIPM can also provide air traffic controllers with accurate and reasonable allocation schedule.


Sign in / Sign up

Export Citation Format

Share Document