You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

ScheduleCloud.go 1.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
  1. /*
  2. Copyright (c) [2023] [pcm]
  3. [pcm-coordinator] is licensed under Mulan PSL v2.
  4. You can use this software according to the terms and conditions of the Mulan PSL v2.
  5. You may obtain a copy of Mulan PSL v2 at:
  6. http://license.coscl.org.cn/MulanPSL2
  7. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
  8. EITHER EXPaRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
  9. MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
  10. See the Mulan PSL v2 for more details.
  11. */
  12. package mqs
  13. import (
  14. "context"
  15. "gitlink.org.cn/jcce-pcm/pcm-coordinator/api/internal/svc"
  16. "gitlink.org.cn/jcce-pcm/pcm-coordinator/pkg/scheduler"
  17. )
  18. /*
  19. *
  20. Listening to the payment flow status change notification message queue
  21. */
  22. type CloudMq struct {
  23. ctx context.Context
  24. svcCtx *svc.ServiceContext
  25. }
  26. func NewCloudMq(ctx context.Context, svcCtx *svc.ServiceContext) *CloudMq {
  27. return &CloudMq{
  28. ctx: ctx,
  29. svcCtx: svcCtx,
  30. }
  31. }
  32. func (l *CloudMq) Consume(val string) error {
  33. // 接受消息, 根据标签筛选过滤
  34. cloudScheduler := scheduler.NewCloudScheduler()
  35. schdl, err := scheduler.NewScheduler(cloudScheduler, val, l.svcCtx.DbEngin, l.svcCtx.ParticipantRpc)
  36. if err != nil {
  37. return err
  38. }
  39. schdl.MatchLabels()
  40. // 调度算法
  41. err = schdl.AssignAndSchedule()
  42. if err != nil {
  43. return err
  44. }
  45. // 存储数据
  46. err = schdl.SaveToDb()
  47. if err != nil {
  48. return err
  49. }
  50. return nil
  51. }

PCM is positioned as Software stack over Cloud, aiming to build the standards and ecology of heterogeneous cloud collaboration for JCC in a non intrusive and autonomous peer-to-peer manner.