Coordination mechanisms for decentralized parallel systems

Cohen, Johanne; Cordeiro, Daniel; Trystram, Denis

doi:10.1002/cpe.3298

Cited by 3 publications

(4 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Property (3) can be deduced from the fact that x j ≥ 0 and from Equation (7). Now, we apply Theorem 6 to Example 1.…”

Section: Stable Coalitions On the Choreography Enactment Pricing Gamementioning

confidence: 97%

“…The problem of scheduling jobs on independent, selfish organizations sharing a common infrastructureknown as the Multi Organization Scheduling Problem or MOSP-was first studied by Pascual et al [12,20] and was then extended to include notions from game-theory by Cohen et al [7,8]. The original studies does not include the ability to form coalitions; MOSP only allows rebalancing the jobs between organizations, as long as no organization presents a performance degradation according to their its own performance objective.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Detecting service provider alliances on the choreography enactment pricing game

Cohen,

Cordeiro,

Echabbi

2016

Preprint

Self Cite

View full text Add to dashboard Cite

We present the choreography enactment pricing game, a cooperative game-theoretic model for the study of scheduling of jobs using competitor service providers. A choreography (a peer-to-peer service composition model) needs a set of services to fulfill its jobs requirements. Users must choose, for each requirement, which service providers will be used to enact the choreography at lowest cost. Due to the lack of centralization, vendors can form alliances to control the market. We show a novel algorithm capable of detecting alliances among service providers, based on our study of the bargaining set of this game.

show abstract

“…Property (3) can be deduced from the fact that x j ≥ 0 and from Equation (7). Now, we apply Theorem 6 to Example 1.…”

Section: Stable Coalitions On the Choreography Enactment Pricing Gamementioning

confidence: 97%

Section: Related Workmentioning

confidence: 99%

Detecting service provider alliances on the choreography enactment pricing game

Cohen,

Cordeiro,

Echabbi

2016

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many authors have analyzed various mechanisms based on game strategies. For example, Cohen et al 13 introduced a game theoretic model for the problem of scheduling parallel rigid jobs on multicore platforms with a price cost to determine the best strategy for their jobs. Cole et al 14 presented simple mechanisms that required only local information and used the game theoretic insights to obtain a new combinatorial approximation algorithm for the underlying optimization problem.…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study an agent-based scheduling problem of two identical parallel machines:. The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.

show abstract

“…Many authors have analyzed various good mechanisms based on the game strategies. For example, Cohen et al 13 introduce a game-theoretic model for the problem of scheduling parallel rigid jobs on multicore platforms by a price cost to choose the best strategy for their jobs. Cole et al 14 state simple mechanisms that require only local information.…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Yu¹,

Wen²,

Sangbong³

2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study a base-agent scheduling problem of two identical parallel machines: P2jCoj P T A , C B max . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed in order to achieve the optimum of task agents, which contains two agents: agent A and agent B. The objective is divided into two classes. The objective of agent A and agent B is to minimize total tardiness time and minimize makespan, respectively. In this article, we research character of two identical parallel machines that one category job can be processed by one machine agent only or two machine agents and propose a new multi-agent model on two identical parallel machines, divided into two subsystems. For subsystem 1, it is applied by a dynamic scheduling environment. Shortest processed time order is proposed to solve jobs' priorities. Single distribution strategy is proposed to solve assignment of jobs to machine agents. For subsystem 2, centralized distribution strategy applied to a static scheduling environment is addressed. The new model performs more efficiently and owns a stronger ability to deal with complex and dynamic scheduling environments.

show abstract

Coordination mechanisms for decentralized parallel systems

Cited by 3 publications

References 35 publications

Detecting service provider alliances on the choreography enactment pricing game

Detecting service provider alliances on the choreography enactment pricing game

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Contact Info

Product

Resources

About