WO2021143287A1 - 服务调度方法、装置、电子设备及存储介质 - Google Patents

服务调度方法、装置、电子设备及存储介质 Download PDF

Info

Publication number
WO2021143287A1
WO2021143287A1 PCT/CN2020/125932 CN2020125932W WO2021143287A1 WO 2021143287 A1 WO2021143287 A1 WO 2021143287A1 CN 2020125932 W CN2020125932 W CN 2020125932W WO 2021143287 A1 WO2021143287 A1 WO 2021143287A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
scheduling
service scheduling
sequence
task
Prior art date
Application number
PCT/CN2020/125932
Other languages
English (en)
French (fr)
Inventor
李明杰
宋德超
贾巨涛
吴伟
胡天云
Original Assignee
珠海格力电器股份有限公司
珠海联云科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 珠海格力电器股份有限公司, 珠海联云科技有限公司 filed Critical 珠海格力电器股份有限公司
Priority to EP20914465.8A priority Critical patent/EP4092529A4/en
Priority to US17/793,567 priority patent/US20230063202A1/en
Publication of WO2021143287A1 publication Critical patent/WO2021143287A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load

Definitions

  • the present invention relates to the field of smart home technology, in particular to a service scheduling method, device, electronic equipment and storage medium.
  • Smart home (home automation) is based on the residence as a platform, using integrated wiring technology, network communication technology, security technology, automatic control technology, audio and video technology to integrate facilities related to home life to build efficient residential facilities and homes
  • the management system of schedule affairs improves home safety, convenience, comfort, and artistry, and realizes an environmentally friendly and energy-saving living environment.
  • the embodiment of the present invention provides a service scheduling method, Devices, electronic equipment and storage media.
  • the specific technical solutions are as follows:
  • a service scheduling method is provided first, and the above method includes:
  • the service scheduling task is composed of a first identifier corresponding to the service request and a second identifier corresponding to the device receiving the service request;
  • the foregoing determining a target service scheduling sequence from at least one of the foregoing service scheduling sequences includes:
  • the target service scheduling sequence is determined from the at least one service scheduling sequence based on the scheduling value.
  • the foregoing calculation of the scheduling value corresponding to at least one of the foregoing service scheduling sequence includes:
  • the above-mentioned importance, the above-mentioned utilization rate, and the above-mentioned occupancy rate are input into a preset scheduling value calculation model, so that the above-mentioned scheduling value calculation model outputs a scheduling value.
  • the aforementioned scheduling value calculation model includes:
  • the above DV is the scheduling value
  • the above I is the importance degree
  • the above F is the utilization rate
  • the above U is the occupancy rate
  • the above A is the weight corresponding to the importance degree
  • the above B is the weight corresponding to the utilization rate
  • the above C is the occupancy rate. the weight of.
  • the foregoing determining a target service scheduling sequence from at least one of the foregoing service scheduling sequences based on the foregoing scheduling value includes:
  • the target service scheduling sequence is determined from at least one of the above-mentioned service scheduling sequences based on the above-mentioned difference.
  • the foregoing determining a target service scheduling sequence from at least one of the foregoing service scheduling sequences based on the foregoing difference includes:
  • the service scheduling sequence corresponding to the smallest difference is determined as the target service scheduling sequence.
  • the foregoing obtaining service scheduling task includes:
  • the service scheduling task is collected from the service scheduling task.
  • a service scheduling device includes:
  • the task acquisition module is configured to acquire a service scheduling task, where the above-mentioned service scheduling task is composed of a first identifier corresponding to the service request and a second identifier corresponding to the device receiving the above-mentioned service request;
  • An identification search module which is used to search for a third identification corresponding to the service associated with the above-mentioned service scheduling task in the preset service scheduling knowledge graph;
  • a sequence generation module configured to generate at least one service scheduling sequence based on the above-mentioned service scheduling task and the third identifier corresponding to the above-mentioned service;
  • a sequence determining module configured to determine a target service scheduling sequence from at least one of the above-mentioned service scheduling sequences
  • the device notification module is used to notify the device to access the service corresponding to the third identifier in the target service scheduling sequence.
  • an electronic device including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory complete mutual communication through the communication bus;
  • Memory used to store computer programs
  • the processor is configured to implement any one of the above-mentioned service scheduling methods in the above-mentioned first aspect when executing the program stored in the memory.
  • a storage medium stores instructions that, when run on a computer, cause the computer to execute any of the service scheduling methods described in the first aspect.
  • a computer program product containing instructions, which when run on a computer, causes the computer to execute any one of the above-mentioned service scheduling methods in the above-mentioned first aspect.
  • the third identifier corresponding to the service associated with the service scheduling task is found by obtaining the service scheduling task, based on the service scheduling knowledge graph, and generating at least the third identifier corresponding to the service scheduling task based on the service scheduling task and the third identifier corresponding to the service.
  • a service scheduling sequence determines the target service scheduling sequence from at least one service scheduling sequence, so as to notify the device to access the service corresponding to the third identifier in the target service scheduling sequence.
  • FIG. 1 is a schematic diagram of an implementation process of a service scheduling method shown in an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a service scheduling knowledge graph shown in an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of an implementation process of another service scheduling method shown in an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a service scheduling device shown in an embodiment of the present invention.
  • Fig. 5 is a schematic structural diagram of an electronic device shown in an embodiment of the present invention.
  • FIG. 1 it is a schematic diagram of the implementation process of a service scheduling method provided by an embodiment of the present invention.
  • the method may specifically include the following steps:
  • a service request may be input to the IoT device in the smart home system through voice input or remote control.
  • the above service request can be received, and the corresponding service can be accessed according to the service request to provide the user with the service.
  • multiple service scheduling tasks can be generated to form a service scheduling task set.
  • the first identifier corresponding to the service request such as 1, 2, 3 shown in Table 1
  • the second identification composition corresponding to the device receiving the service request such as A, B, and C shown in Table 1 above.
  • a service scheduling task T is generated in a centralized manner, and the service scheduling task T is composed of a first identifier 1 corresponding to the service request in Table 1 and a second identifier A corresponding to the device A receiving the service request 1.
  • the embodiment of the present invention can obtain the above-mentioned service scheduling tasks from the service scheduling task set, and process the service scheduling tasks to facilitate the implementation of subsequent service scheduling strategies.
  • the service scheduling tasks can be represented by a two-tuple, for example ( Service request 1, device A), means that device A receives service request 1.
  • the identifier may be an ID or a name, which is not limited in the embodiment of the present invention.
  • a service scheduling knowledge graph may be established in advance according to the first identifier corresponding to the service request, the second identifier corresponding to the device, and the third identifier corresponding to the service, and the relationship between the three It is composed of nodes and edges.
  • FIG. 1 A schematic diagram of a service scheduling knowledge graph provided.
  • the requesting node For the requesting node, it is composed of the first identifier corresponding to the service request and the importance I, such as (service request 1, I); for the device node, it is composed of the second identifier corresponding to the device and the utilization rate F, such as (device A, F ); For the service node, it is composed of the third identifier corresponding to the service and the occupancy U, for example (service 1, U).
  • the request to the device side is composed of logical calculations (and, or) and weight p, for example, service request 1 (and, p) device A, device B, which means that device A and device B are required to process service request 1, and the service request
  • the importance of 1 is p; for the device-to-service edge, it consists of logical calculations (and, or) and weight q, such as device A (or, q) service 1, service 2, which means that device A can access service 1 or service 2.
  • the priority of the device is q.
  • the service scheduling task After obtaining the service scheduling task, since the service scheduling task is composed of the first identification corresponding to the service request and the second identification corresponding to the device receiving the service request, it can be in the above-mentioned service scheduling knowledge graph.
  • the request node and the device node are determined, and then the third identifier corresponding to the service associated with the service scheduling task, that is, the service node, is searched in the above-mentioned service scheduling knowledge graph.
  • the service scheduling task can be represented by a two-tuple: (service request 1, device A (and) device B), look for the service corresponding to the service scheduling task in the service scheduling knowledge graph shown in Figure 2
  • the third identifier of: 1 or 2 means that device A (and) device B can access service 1 or service 2 in order to process service request 1.
  • S103 Generate at least one service scheduling sequence based on the foregoing service scheduling task and the third identifier corresponding to the foregoing service;
  • At least one service scheduling sequence can be generated in the embodiment of the present invention, and the service scheduling sequence can be represented by a triplet, for example (service request 1, device A (and) device B, service 1 (or service 2), means that device A (and) device B can access service 1 or service 2 in order to process service request 1.
  • the service scheduling task can be represented by a two-tuple: (service request 1, device A (and) device B), the third identifier corresponding to the service: 1 or 2, generated based on the above two The following two service scheduling sequences.
  • the service scheduling sequence is composed of the first identifier corresponding to the service request, the second identifier corresponding to the device receiving the service request, and the third identifier of the associated service, which can be expressed as a triplet.
  • S104 Determine a target service scheduling sequence from at least one of the foregoing service scheduling sequences
  • the embodiment of the present invention determines the target service scheduling sequence from the at least one service scheduling sequence.
  • the optional implementation manner for determining the target service scheduling sequence may be, for example, polling or random, which is not limited in the embodiment of the present invention.
  • the embodiment of the present invention may determine the service scheduling sequence 1 as the target service scheduling sequence.
  • S105 Notify the above-mentioned device to access the service corresponding to the third identifier in the above-mentioned target service scheduling sequence.
  • the embodiment of the present invention can notify the above-mentioned device to access the service corresponding to the third identifier in the target service scheduling sequence, so that the optimization of service distribution can be realized, and high-quality services and experience can be provided to users.
  • the device 1 may be notified that the service (service 1) corresponding to the third identifier in the service scheduling sequence 1 can be accessed.
  • FIG. 3 it is a schematic diagram of the implementation process of another service scheduling method provided by an embodiment of the present invention.
  • the method may specifically include the following steps:
  • S301 based on the generation time of the service scheduling task, obtain the service scheduling task from the service scheduling task set, where the service scheduling task is composed of a first identifier corresponding to the service request and a second identifier corresponding to the device receiving the service request;
  • the service scheduling tasks may be obtained from the service scheduling task set based on the generation time of the service scheduling task.
  • the generation time of a certain service scheduling task may be consistent with the generation time of other service scheduling tasks, or may be inconsistent with the generation time of other service scheduling tasks, which is not limited in the embodiment of the present invention.
  • the embodiment of the present invention may acquire the multiple service scheduling tasks from the service scheduling tasks based on the generation time of the service scheduling tasks.
  • S302 Search for a third identifier corresponding to the service associated with the above-mentioned service scheduling task in a preset service scheduling knowledge graph;
  • this step is similar to the above step S102, and the embodiment of the present invention will not be repeated here.
  • S303 Generate at least one service scheduling sequence based on the foregoing service scheduling task and the third identifier corresponding to the foregoing service;
  • this step is similar to the above-mentioned step S103, and the embodiment of the present invention will not be repeated here.
  • S304 Determine a target service scheduling sequence from at least one of the foregoing service scheduling sequences
  • calculating the scheduling value corresponding to the at least one service scheduling sequence means that for each service scheduling sequence, there is one scheduling value corresponding to one to one.
  • the target service scheduling sequence may be determined from at least one service scheduling sequence based on the above-mentioned calculated scheduling value.
  • the scheduling value D1 corresponding to the service scheduling sequence 1 is calculated, and the scheduling value D2 corresponding to the service scheduling sequence 2 is calculated, as shown in Table 3 below.
  • the target service scheduling sequence can be determined from the service scheduling sequence 1 and the service scheduling sequence 2.
  • An optional implementation manner for calculating the scheduling value corresponding to at least one service scheduling sequence is as follows:
  • the occupancy rate is input to the preset scheduling value calculation model, so that the scheduling value calculation model outputs the scheduling value.
  • the importance of a service request is determined by the number of triggers of the service request. When the device receives the service request, it is recorded as triggered once.
  • the range of importance can be 0-1, the greater the value, the higher the importance.
  • the utilization rate of the device can be obtained by dividing the number of service requests currently received by the total number of service requests allowed to be received. For example, if the number of service requests currently received by the device is 50, and the total number of service requests allowed to be received is 100, the utilization rate of the device is 50%.
  • the occupancy rate of the service can be obtained by dividing the number of devices currently accessing the service by the total number of devices allowed to access the service. For example, if the number of devices currently accessing the service is 50, and the total number of devices allowed to access the service is 100, the share of the service is 50%.
  • the embodiment of the present invention obtains the importance of the service request 1 corresponding to the first identifier in the service scheduling sequence 1, the utilization rate of the device 1 corresponding to the second identifier, and the service corresponding to the third identifier. 1 occupancy rate;
  • the importance of the service request 1 corresponding to the first identifier, the utilization rate of the device 1 corresponding to the second identifier, and the occupancy rate of the service 1 corresponding to the third identifier obtained above are input into the preset scheduling value calculation model, so that The aforementioned scheduling value calculation model outputs the scheduling value D1 corresponding to the service scheduling sequence 1.
  • the above DV is the scheduling value
  • the above I is the importance degree
  • the above F is the utilization rate
  • the above U is the occupancy rate
  • the above A is the weight corresponding to the importance degree
  • the above B is the weight corresponding to the utilization rate
  • the above C is the occupancy rate. the weight of.
  • the weight corresponding to the importance degree, the weight corresponding to the utilization rate, and the weight corresponding to the occupancy rate can be set according to actual needs, which is not limited in the embodiment of the present invention.
  • An optional implementation manner of determining a target service scheduling sequence from at least one of the foregoing service scheduling sequences based on the foregoing scheduling value is as follows:
  • the optimal scheduling value threshold can be set in advance, and the difference between any scheduling value and the scheduling value threshold can be calculated.
  • service scheduling sequence 1 as an example, for the scheduling value corresponding to service scheduling sequence 1 D1.
  • the difference between the scheduling value and the preset scheduling value threshold may be sorted, and from at least one service scheduling sequence, the service scheduling sequence corresponding to the smallest difference is determined as the target service scheduling sequence.
  • the scheduling value D1 corresponding to the service scheduling sequence 1 calculates the difference a between the scheduling value D1 and the scheduling value threshold, and for the scheduling value D2 corresponding to the service scheduling sequence 2, calculate the difference between the scheduling value D2 and the scheduling value threshold Compare the difference b between the above-mentioned difference a and the difference b. Assuming that the difference a is less than the difference b, it can be determined that the service scheduling sequence 1 corresponding to the difference a is the target service scheduling sequence.
  • S305 Notify the above-mentioned device to access the service corresponding to the third identifier in the above-mentioned target service scheduling sequence.
  • this step is similar to the above step S105, and the embodiment of the present invention will not be repeated here.
  • the embodiment of the present invention also provides a service scheduling device.
  • the device may include: a task acquisition module 410, an identification search module 420, a sequence generation module 430, and a sequence determination module 440. , Device notification module 450.
  • the task acquisition module 410 is configured to acquire a service scheduling task, where the above-mentioned service scheduling task is composed of a first identifier corresponding to the service request and a second identifier corresponding to the device receiving the above-mentioned service request;
  • the identification search module 420 is configured to search for a third identification corresponding to the service associated with the above-mentioned service scheduling task in the preset service scheduling knowledge graph;
  • the sequence generation module 430 is configured to generate at least one service scheduling sequence based on the above-mentioned service scheduling task and the third identifier corresponding to the above-mentioned service;
  • the sequence determining module 440 is configured to determine a target service scheduling sequence from at least one of the foregoing service scheduling sequences;
  • the device notification module 450 is configured to notify the aforementioned device to access the service corresponding to the third identifier in the aforementioned target service scheduling sequence.
  • the above-mentioned sequence determination module 440 includes:
  • the scheduling value calculation sub-module 441 is configured to calculate the scheduling value corresponding to at least one of the above-mentioned service scheduling sequences;
  • the sequence determining sub-module 442 is configured to determine a target service scheduling sequence from at least one of the service scheduling sequences based on the scheduling value.
  • the aforementioned scheduling value calculation submodule 441 is specifically configured to:
  • the above-mentioned importance, the above-mentioned utilization rate, and the above-mentioned occupancy rate are input into a preset scheduling value calculation model, so that the above-mentioned scheduling value calculation model outputs a scheduling value.
  • the aforementioned scheduling value calculation model includes:
  • the above DV is the scheduling value
  • the above I is the importance degree
  • the above F is the utilization rate
  • the above U is the occupancy rate
  • the above A is the weight corresponding to the importance degree
  • the above B is the weight corresponding to the utilization rate
  • the above C is the occupancy rate. the weight of.
  • the aforementioned sequence determination submodule 442 includes:
  • the difference calculation unit 4421 is configured to calculate the difference between the foregoing scheduling value and the preset scheduling value threshold
  • the sequence determining unit 4422 is configured to determine a target service scheduling sequence from at least one of the foregoing service scheduling sequences based on the foregoing difference.
  • the aforementioned sequence determining unit 4422 is specifically configured to:
  • the service scheduling sequence corresponding to the smallest difference is determined as the target service scheduling sequence.
  • the above-mentioned task acquisition module 410 is specifically configured to:
  • the service scheduling task is collected from the service scheduling task.
  • the task acquisition module 410, the identification search module 420, the sequence generation module 430, the sequence determination module 440, the device notification module 450, etc. can be run in the computer terminal as part of the device, and can be run in the computer terminal through the
  • the processor executes the functions implemented by the above modules, and the terminal can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, and a mobile Internet device (MID), PAD and other terminal devices.
  • the functional units provided in the embodiments of the present application may run in a mobile terminal, a computer terminal or a similar computing device, or may be stored as a part of a storage medium.
  • the embodiments of the present disclosure may provide a computer terminal, and the computer terminal may be any computer terminal device in a computer terminal group.
  • the above-mentioned computer terminal may also be replaced with a terminal device such as a mobile terminal.
  • the foregoing computer terminal may be located in at least one network device among multiple network devices in the computer network.
  • the computer terminal may include the program code of the following steps in the service scheduling method: acquiring a service scheduling task, wherein the service scheduling task is identified by the first identifier corresponding to the service request, and the first identifier corresponding to the device receiving the service request.
  • Identification composition search for the third identification corresponding to the service associated with the above-mentioned service scheduling task in the preset service scheduling knowledge graph; generate at least one service scheduling sequence based on the above-mentioned service scheduling task and the third identification corresponding to the above-mentioned service;
  • the target service scheduling sequence is determined from at least one of the foregoing service scheduling sequences; and the device is notified to access the service corresponding to the third identifier in the foregoing target service scheduling sequence.
  • the computer terminal may include: one or more processors, memories, and transmission devices.
  • the memory can be used to store software programs and modules, such as program instructions/modules corresponding to the game character control method and device in the embodiments of the present disclosure.
  • the processor executes various functions by running the software programs and modules stored in the memory.
  • Application and data processing that is, realize the above-mentioned service scheduling method.
  • the memory may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory may further include a memory remotely provided with respect to the processor, and these remote memories may be connected to the terminal through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the aforementioned transmission device is used to receive or send data via a network.
  • the above-mentioned specific examples of the network may include a wired network and a wireless network.
  • the transmission device includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers through a network cable so as to communicate with the Internet or a local area network.
  • the transmission device is a radio frequency (RF) module, which is used to communicate with the Internet in a wireless manner.
  • RF radio frequency
  • the memory is used for cooking and discharging application programs
  • the processor can call the information and application programs stored in the memory through the transmission device to execute the program codes of the method steps of the various optional or preferred embodiments in the foregoing method embodiments. .
  • the computer terminal may also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, and a mobile Internet device (MID), PAD and other terminal devices.
  • a smart phone such as an Android phone, an iOS phone, etc.
  • a tablet computer such as a Samsung Galaxy Tab, etc.
  • a palmtop computer such as a Samsung Galaxy Tab, etc.
  • MID mobile Internet device
  • the program can be stored in a computer-readable storage medium, which can be Including: flash disk, read-only memory (Read-Only Memory, ROM), random access device (Random Access Memory, RAM), magnetic disk or optical disk, etc.
  • the embodiment of the present invention also provides an electronic device, as shown in FIG. 5, including a processor 51, a communication interface 52, a memory 53, and a communication bus 54.
  • the processor 51, the communication interface 52, and the memory 53 pass through the communication bus 54. Complete the communication between each other,
  • the memory 53 is used to store computer programs
  • the processor 51 is configured to implement the following steps when executing the program stored in the memory 53:
  • Obtain a service scheduling task where the above service scheduling task is composed of a first identifier corresponding to the service request and a second identifier corresponding to the device receiving the above service request; search for information related to the above service scheduling task in the preset service scheduling knowledge graph The third identifier corresponding to the connected service; generate at least one service scheduling sequence based on the service scheduling task and the third identifier corresponding to the service; determine the target service scheduling sequence from the at least one service scheduling sequence; notify the device to access the target The service corresponding to the third identifier in the service scheduling sequence.
  • the communication bus mentioned in the above electronic device may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc.
  • PCI Peripheral Component Interconnect
  • EISA Extended Industry Standard Architecture
  • the communication bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.
  • the communication interface is used for communication between the above-mentioned electronic device and other devices.
  • the memory may include random access memory (Random Access Memory, RAM for short), or may include non-volatile memory (non-volatile memory), such as at least one disk memory.
  • RAM Random Access Memory
  • non-volatile memory such as at least one disk memory.
  • the memory may also be at least one storage device located far away from the foregoing processor.
  • the above-mentioned processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU for short), a network processor (Network Processor, NP), etc.; it may also be a digital signal processor (Digital Signal Processing, DSP for short) , Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • CPU Central Processing Unit
  • NP Network Processor
  • DSP Digital Signal Processing
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • a storage medium stores instructions, which when run on a computer, cause the computer to execute any of the above-mentioned service scheduling methods in the above-mentioned embodiments.
  • a computer program product containing instructions, which when run on a computer, causes the computer to execute any of the above-mentioned service scheduling methods in the above-mentioned embodiments.
  • the above-mentioned embodiments it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software it can be implemented in the form of a computer program product in whole or in part.
  • the above-mentioned computer program product includes one or more computer instructions. When the above computer program instructions are loaded and executed on the computer, all or part of the above procedures or functions according to the embodiments of the present invention are generated.
  • the above-mentioned computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the above-mentioned computer instructions can be stored in a storage medium or transmitted from one storage medium to another storage medium.
  • the above-mentioned computer instructions can be transmitted from a website, computer, server, or data center through a wired (such as coaxial cable, optical fiber, digital Subscriber line (DSL) or wireless (such as infrared, wireless, microwave, etc.) to another website site, computer, server or data center.
  • the foregoing storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center integrated with one or more available media.
  • the above-mentioned usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)).

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明实施例提供了一种服务调度方法、装置、电子设备及存储介质，上述方法包括：获取服务调度任务，其中，服务调度任务由服务请求对应的第一标识，以及接收服务请求的设备对应的第二标识组成；在预设的服务调度知识图谱中查找与服务调度任务相关联的服务对应的第三标识；基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；从至少一个上述服务调度序列中确定目标服务调度序列；通知上述设备访问上述目标服务调度序列中第三标识对应的服务。通过从至少一个服务调度序列中确定目标服务调度序列，并通知设备访问目标服务调度序列中第三标识对应的服务，可以实现服务分配的最优化，可以为用户提供优质的服务以及体验。

Description

服务调度方法、装置、电子设备及存储介质
相关申请的交叉引用
本申请要求于2020年01月16日提交的申请号为202010048710.7，名称为“服务调度方法、装置、电子设备及存储介质”的中国专利申请的优先权，该中国专利申请的全部内容通过引用全部并入本文。
技术领域
本发明涉及智能家居技术领域，尤其涉及一种服务调度方法、装置、电子设备及存储介质。
背景技术
智能家居(smart home，home automation)是以住宅为平台，利用综合布线技术、网络通信技术、安全防范技术、自动控制技术、音视频技术将家居生活有关的设施集成，构建高效的住宅设施与家庭日程事务的管理***，提升家居安全性、便利性、舒适性、艺术性，并实现环保节能的居住环境。随着智能家居***中物联网设备的不断增多以及服务的不断增加，各种服务之间的最优调度问题越来越显著和亟待解决。
相关技术中，仅仅通过设置固定的规则进行调度，无法实现服务分配的最优化，导致无法为用户提供优质的服务以及体验。例如，存在多个音乐服务的情况下，仅仅通过设置固定的规则进行调度，使音乐空调只能固定地访问单一的音乐服务，当该音乐服务宕机或者达到最大访问量时，音乐空调无法进行访问，无法为用户提供音乐服务。
发明内容
为了解决上述现有技术中仅仅通过设置固定的规则进行调度，无法实现服务分配的最优化，导致无法为用户提供优质的服务以及体验的技术问题，本发明实施例提供了一种服务调度方法、装置、电子设备及存储介质。具体技术方案如下：
在本发明实施例的第一方面，首先提供了一种服务调度方法，上述方 法包括：
获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；
在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；
基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；
从至少一个上述服务调度序列中确定目标服务调度序列；
通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
在一个可选的实施方式中，上述从至少一个上述服务调度序列中确定目标服务调度序列，包括：
计算至少一个上述服务调度序列对应的调度值；
基于上述调度值从至少一个上述服务调度序列中确定目标服务调度序列。
在一个可选的实施方式中，上述计算至少一个上述服务调度序列对应的调度值，包括：
获取至少一个上述服务调度序列中第一标识对应的服务请求的重要度，第二标识对应的设备的利用率，以及第三标识对应的服务的占有率；
将上述重要度、上述利用率以及上述占有率输入预设的调度值计算模型，以使上述调度值计算模型输出调度值。
在一个可选的实施方式中，上述调度值计算模型，包括：
DV＝I*A+F*B+U*C；
其中，上述DV为调度值，上述I为重要度，上述F为利用率，上述U为占有率，上述A为重要度对应的权重，上述B为利用率对应的权重，上述C为占有率对应的权重。
在一个可选的实施方式中，上述基于上述调度值从至少一个上述服务 调度序列中确定目标服务调度序列，包括：
计算上述调度值与预设调度值阈值之间的差值；
基于上述差值从至少一个上述服务调度序列中确定目标服务调度序列。
在一个可选的实施方式中，上述基于上述差值从至少一个上述服务调度序列中确定目标服务调度序列，包括：
从至少一个上述服务调度序列中，确定最小差值对应的服务调度序列为目标服务调度序列。
在一个可选的实施方式中，上述获取服务调度任务，包括：
基于服务调度任务的生成时刻，从服务调度任务集中获取服务调度任务。
在本发明实施例的第二方面，还提供了一种服务调度装置，上述装置包括：
任务获取模块，用于获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；
标识查找模块，用于在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；
序列生成模块，用于基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；
序列确定模块，用于从至少一个上述服务调度序列中确定目标服务调度序列；
设备通知模块，用于通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
在本发明实施例的第三方面，还提供了一种电子设备，包括处理器、通信接口、存储器和通信总线，其中，处理器，通信接口，存储器通过通信总线完成相互间的通信；
存储器，用于存放计算机程序；
处理器，用于执行存储器上所存放的程序时，实现上述第一方面中任一上述的服务调度方法。
在本发明实施例的第四方面，还提供了一种存储介质，上述存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述第一方面中任一上述的服务调度方法。
在本发明实施例的第五方面，还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述第一方面中任一上述的服务调度方法。
本发明实施例提供的技术方案，通过获取服务调度任务，基于服务调度知识图谱，查找与服务调度任务相关联的服务对应的第三标识，基于服务调度任务以及服务对应的第三标识，生成至少一个服务调度序列，从至少一个服务调度序列中确定目标服务调度序列，从而通知设备访问目标服务调度序列中第三标识对应的服务。通过从至少一个服务调度序列中确定目标服务调度序列，并通知设备访问目标服务调度序列中第三标识对应的服务，可以实现服务分配的最优化，可以为用户提供优质的服务以及体验。
附图说明
此处的附图被并入说明书中并构成本说明书的一部分，示出了符合本发明的实施例，并与说明书一起用于解释本发明的原理。
为了更清楚地说明本发明实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，对于本领域普通技术人员而言，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1为本发明实施例中示出的一种服务调度方法的实施流程示意图；
图2为本发明实施例中示出的一种服务调度知识图谱示意图；
图3为本发明实施例中示出的另一种服务调度方法的实施流程示意图；
图4为本发明实施例中示出的一种服务调度装置的结构示意图；
图5为本发明实施例中示出的一种电子设备的结构示意图。
具体实施方式
为使本发明实施例的目的、技术方案和优点更加清楚，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本发明的一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动的前提下所获得的所有其他实施例，都属于本发明保护的范围。
如图1所示，为本发明实施例提供的一种服务调度方法的实施流程示意图，该方法具体可以包括以下步骤：
S101，获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；
在本发明实施例中，当用户需要某个服务时，例如音乐服务，可以通过语音输入或者遥控器等形式向智能家居***中物联网设备输入服务请求。
在物联网设备这一侧，可以接收到上述服务请求，从而根据该服务请求去访问相应的服务，为用户提供服务。
如此对于智能家居***中的任一物联网设备，可以接收到对应的服务请求，如下表1所示。
表1
服务请求 物联网设备
1 A
2 B
3 C
基于上述可以生成多个服务调度任务，可以组成服务调度任务集，对于服务调度任务集中任一服务调度任务，由服务请求对应的第一标识，例如上述表1所示的1、2、3，以及接收该服务请求的设备对应的第二标识组成，例如上述表1所示的A、B、C。
例如，对于服务调度任务集中生成服务调度任务T，该服务调度任务T由上述表1中的服务请求对应的第一标识1，以及接收该服务请求1的设备A对应的第二标识A组成。
在服务调度阶段，本发明实施例可以从服务调度任务集中获取上述服务调度任务，对服务调度任务进行处理，以便于执行后续的服务调度策略，该服务调度任务可以由二元组表示，例如(服务请求1，设备A)，表示设备A接收到服务请求1。
需要说明的是，在本发明实施例中标识可以是ID，可以是名称，本发明实施例对此不作限定。
S102，在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；
在本发明实施例中，可以根据服务请求对应的第一标识、设备对应的第二标识、服务对应的第三标识，三者之间的关联关系预先建立服务调度知识图谱，该服务调度知识图谱由节点和边组成。
其中，该服务调度知识图谱中节点存在3种类型：请求节点、设备节点以及服务节点，该服务调度知识图谱中边存在2种类型：and和or，如图2所示，为本发明实施例提供的一种服务调度知识图谱的示意图。
对于请求节点，由服务请求对应的第一标识以及重要度I组成，例如(服务请求1，I)；对于设备节点，由设备对应的第二标识以及利用率F组成，例如(设备A，F)；对于服务节点，由服务对应的第三标识以及占有率U组成，例如(服务1，U)。
对于请求至设备的边，由逻辑计算(and、or)和权重p组成，例如服务请求1(and，p)设备A、设备B，表示处理服务请求1需要设备A以及设备B，并且服务请求1的重要性为p；对于设备至服务的边，由逻辑计算(and、or)和权重q组成，例如设备A(or，q)服务1、服务2，表示设备A可以访问服务1或者服务2，并且设备的优先度为q。
基于上述服务调度知识图谱，在获取服务调度任务之后，由于服务调度任务由服务请求对应的第一标识，以及接收该服务请求的设备对应的第 二标识组成，即在上述服务调度知识图谱中可以确定请求节点以及设备节点，进而在上述服务调度知识图谱中查找与该服务调度任务相关联的服务对应的第三标识，即服务节点。
例如，该服务调度任务可以由二元组表示：(服务请求1，设备A(and)设备B)，在如图2所示的服务调度知识图谱中查找与该服务调度任务相关联的服务对应的第三标识：1或2，意味着设备A(and)设备B为了处理服务请求1，可以访问服务1或者服务2。
S103，基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；
针对上述服务调度任务以及服务对应的第三标识，在本发明实施例中可以生成至少一个服务调度序列，该服务调度序列可以由三元组表示，例如(服务请求1，设备A(and)设备B，服务1(or)服务2)，意味着设备A(and)设备B为了处理服务请求1，可以访问服务1或者服务2。
例如，在本发明实施例中该服务调度任务可以由二元组表示：(服务请求1，设备A(and)设备B)，该服务对应的第三标识：1或2，基于上述两者生成如下两个服务调度序列。
表2
Figure PCTCN2020125932-appb-000001
由上述表2可知，对于服务调度序列，由服务请求对应的第一标识，接收该服务请求的设备对应的第二标识，以及相关联的服务的第三标识组成，可以表示为三元组。
S104，从至少一个上述服务调度序列中确定目标服务调度序列；
对于上述生成的至少一个服务调度序列，本发明实施例从至少一个服 务调度序列中确定目标服务调度序列。
其中，对于确定目标服务调度序列的可选实施方式，例如可以是轮询，可以是随机，本发明实施例对此不作限定。
例如，对于上述生成的服务调度序列1以及服务调度序列2，本发明实施例可以确定服务调度序列1为目标服务调度序列。
S105，通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
对于上述步骤确定的目标服务调度序列，本发明实施例可以通知上述设备访问目标服务调度序列中第三标识对应的服务，如此可以实现服务分配的最优化，可以为用户提供优质的服务以及体验。
例如，对于上述确定的目标服务调度序列(服务调度序列1)，可以通知上述设备1可以访问服务调度序列1中第三标识对应的服务(服务1)。
通过上述对本发明实施例提供的技术方案的描述，通过获取服务调度任务，基于服务调度知识图谱，查找与服务调度任务相关联的服务对应的第三标识，基于服务调度任务以及服务对应的第三标识，生成至少一个服务调度序列，从至少一个服务调度序列中确定目标服务调度序列，从而通知设备访问目标服务调度序列中第三标识对应的服务。通过从至少一个服务调度序列中确定目标服务调度序列，并通知设备访问目标服务调度序列中第三标识对应的服务，可以实现服务分配的最优化，可以为用户提供优质的服务以及体验。
如图3所示，为本发明实施例提供的另一种服务调度方法的实施流程示意图，该方法具体可以包括以下步骤：
S301，基于服务调度任务的生成时刻，从服务调度任务集中获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；
在本发明实施例中，对于服务调度任务集中的多个服务调度任务，可以基于服务调度任务的生成时刻，从服务调度任务集中获取服务调度任务。
对于某个服务调度任务的生成时刻，可以与其它服务调度任务的生成时刻一致，也可以与其它服务调度任务的生成时刻不一致，本发明实施例对此不作限定。
例如，在某一时刻并发生成多个服务调度任务，本发明实施例可以基于服务调度任务的生成时刻，从服务调度任务集中获取上述多个服务调度任务。
S302，在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；
在本发明实施例中，本步骤与上述步骤S102类似，本发明实施例在此不再一一赘述。
S303，基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；
在本发明实施例中，本步骤与上述步骤S103类似，本发明实施例在此不再一一赘述。
S304，从至少一个上述服务调度序列中确定目标服务调度序列；
在本发明实施例中，对于上述步骤生成的至少一个服务调度序列，计算至少一个服务调度序列对应的调度值，意味着对于每个服务调度序列，对应一个调度值，一一对应。
可以基于上述计算的调度值，从至少一个服务调度序列中确定目标服务调度序列。
例如，对于上述生成的服务调度序列1以及服务调度序列2，计算服务调度序列1对应的调度值D1，计算服务调度序列2对应的调度值D2，如下表3所示。
表3
服务调度序列 调度值
1 D1
2 D2
基于如上述表3所示的服务调度序列1对应的调度值D1，以及服务调度序列2对应的调度值D2，可以从服务调度序列1以及服务调度序列2中确定目标服务调度序列。
对于计算至少一个服务调度序列对应的调度值的可选实施方式，如下所示：
获取至少一个上述服务调度序列中第一标识对应的服务请求的重要度，第二标识对应的设备的利用率，以及第三标识对应的服务的占有率；将上述重要度、上述利用率以及上述占有率输入预设的调度值计算模型，以使上述调度值计算模型输出调度值。
对于服务请求的重要度，由该服务请求的触发次数决定，设备接收到该服务请求，记为触发一次。例如重要度的范围可以0-1，数值越大重要度越高。
对于设备的利用率，可以由当前接收的服务请求的数量除以允许接收的服务请求的总量得到。例如该设备当前接收的服务请求的数量为50，允许接收的服务请求的总量为100，则该设备的利用率为50％。
对于服务的占有率，可以由当前访问该服务的设备的数量除以允许访问该服务的设备的总数量得到。例如当前访问该服务的设备的数量为50，允许访问该服务的设备的总数量为100，则该服务的占有率为50％。
例如，以服务调度序列1为例，本发明实施例获取服务调度序列1中第一标识对应的服务请求1的重要度，第二标识对应的设备1的利用率，以及第三标识对应的服务1的占有率；
将上述获取的第一标识对应的服务请求1的重要度，第二标识对应的设备1的利用率，以及第三标识对应的服务1的占有率，输入预设的调度值计算模型，以使上述调度值计算模型输出服务调度序列1对应的调度值D1。
对于上述调度值计算模型，可以如下所示：
DV＝I*A+F*B+U*C；
其中，上述DV为调度值，上述I为重要度，上述F为利用率，上述U为占有率，上述A为重要度对应的权重，上述B为利用率对应的权重，上述C为占有率对应的权重。
需要说明的是，对于重要度对应的权重、利用率对应的权重以及占有率对应的权重，可以根据实际需求进行设置，本发明实施例对此不作限定。
对于基于上述调度值从至少一个上述服务调度序列中确定目标服务调度序列的可选实施方式，如下所示：
计算上述调度值与预设调度值阈值之间的差值；基于上述差值从至少一个上述服务调度序列中确定目标服务调度序列。
例如，在本发明实施例中可以预先设置最优调度值阈值，计算任一调度值与该调度值阈值之间的差值，以服务调度序列1为例，对于服务调度序列1对应的调度值D1，计算该调度值D1与调度值阈值之间的差值，基于上述计算的差值，从至少一个上述服务调度序列中确定目标服务调度序列。
对于调度值与预设调度值阈值之间的差值，可以进行排序，从至少一个服务调度序列中，确定最小差值对应的服务调度序列为目标服务调度序列。
例如，对于服务调度序列1对应的调度值D1，计算该调度值D1与调度值阈值之间的差值a，对于服务调度序列2对应的调度值D2，计算该调度值D2与调度值阈值之间的差值b，比较上述差值a与差值b的大小，假设差值a小于差值b，可以确定差值a对应的服务调度序列1为目标服务调度序列。
S305，通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
在本发明实施例中，本步骤与上述步骤S105类似，本发明实施例在此不再一一赘述。
与上述方法实施例对应，本发明实施例还提供了一种服务调度装置，如图4所示，该装置可以包括：任务获取模块410、标识查找模块420、序列生成模块430、序列确定模块440、设备通知模块450。
任务获取模块410，用于获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；
标识查找模块420，用于在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；
序列生成模块430，用于基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；
序列确定模块440，用于从至少一个上述服务调度序列中确定目标服务调度序列；
设备通知模块450，用于通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
在本发明实施例的具体实施方式中，上述序列确定模块440包括：
调度值计算子模块441，用于计算至少一个上述服务调度序列对应的调度值；
序列确定子模块442，用于基于上述调度值从至少一个上述服务调度序列中确定目标服务调度序列。
在本发明实施例的具体实施方式中，上述调度值计算子模块441具体用于：
获取至少一个上述服务调度序列中第一标识对应的服务请求的重要度，第二标识对应的设备的利用率，以及第三标识对应的服务的占有率；
将上述重要度、上述利用率以及上述占有率输入预设的调度值计算模型，以使上述调度值计算模型输出调度值。
在本发明实施例的具体实施方式中，上述调度值计算模型，包括：
DV＝I*A+F*B+U*C；
其中，上述DV为调度值，上述I为重要度，上述F为利用率，上述U为占有率，上述A为重要度对应的权重，上述B为利用率对应的权重，上述C为占有率对应的权重。
在本发明实施例的具体实施方式中，上述序列确定子模块442包括：
差值计算单元4421，用于计算上述调度值与预设调度值阈值之间的差值；
序列确定单元4422，用于基于上述差值从至少一个上述服务调度序列中确定目标服务调度序列。
在本发明实施例的具体实施方式中，上述序列确定单元4422具体用于：
从至少一个上述服务调度序列中，确定最小差值对应的服务调度序列为目标服务调度序列。
在本发明实施例的具体实施方式中，上述任务获取模块410具体用于：
基于服务调度任务的生成时刻，从服务调度任务集中获取服务调度任务。
此处需要说明的是，上述任务获取模块410、标识查找模块420、序列生成模块430、序列确定模块440、设备通知模块450等可以作为装置的一部分运行在计算机终端中，可以通过计算机终端中的处理器来执行上述模块实现的功能，终端也可以是智能手机(如Android手机、iOS手机等)、平板电脑、掌声电脑以及移动互联网设备(Mobile Internet Devices，MID)、PAD等终端设备。
本申请实施例所提供的各个功能单元可以在移动终端、计算机终端或者类似的运算装置中运行，也可以作为存储介质的一部分进行存储。
由此，本公开的实施例可以提供一种计算机终端，该计算机终端可以是计算机终端群中的任意一个计算机终端设备。可选地，在本实施例中，上述计算机终端也可以替换为移动终端等终端设备。
可选地，在本实施例中，上述计算机终端可以位于计算机网络的多个 网络设备中的至少一个网络设备。
在本实施例中，上述计算机终端可以服务调度方法中以下步骤的程序代码：获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；从至少一个上述服务调度序列中确定目标服务调度序列；通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
可选地，该计算机终端可以包括：一个或多个处理器、存储器、以及传输装置。
其中，存储器可用于存储软件程序以及模块，如本公开实施例中的游戏角色控制方法及装置对应的程序指令/模块，处理器通过运行存储在存储器内的软件程序以及模块，从而执行各种功能应用以及数据处理，即实现上述的服务调度方法。存储器可包括高速随机存储器，还可以包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器可进一步包括相对于处理器远程设置的存储器，这些远程存储器可以通过网络连接至终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
上述的传输装置用于经由一个网络接收或者发送数据。上述的网络具体实例可包括有线网络及无线网络。在一个实例中，传输装置包括一个网络适配器(Network Interface Controller，NIC)，其可通过网线与其他网络设备与路由器相连从而可与互联网或局域网进行通讯。在一个实例中，传输装置为射频(Radio Frequency，RF)模块，其用于通过无线方式与互联网进行通讯。
其中，具体地，存储器用于烹饪放电的应用程序，处理器可以通过传输装置调用存储器存储的信息及应用程序，以执行上述方法实施例中的各个可选或优选实施例的方法步骤的程序代码。
本领域普通技术人员可以理解，计算机终端也可以是智能手机(如 Android手机、iOS手机等)、平板电脑、掌声电脑以及移动互联网设备(Mobile Internet Devices，MID)、PAD等终端设备。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通过程序来指令终端设备相关的硬件来完成，该程序可以存储于一计算机可读存储介质中，存储介质可以包括：闪存盘、只读存储器(Read-Only Memory，ROM)、随机存取器(Random Access Memory，RAM)、磁盘或光盘等。
本发明实施例还提供了一种电子设备，如图5所示，包括处理器51、通信接口52、存储器53和通信总线54，其中，处理器51，通信接口52，存储器53通过通信总线54完成相互间的通信，
存储器53，用于存放计算机程序；
处理器51，用于执行存储器53上所存放的程序时，实现如下步骤：
获取服务调度任务，其中，上述服务调度任务由服务请求对应的第一标识，以及接收上述服务请求的设备对应的第二标识组成；在预设的服务调度知识图谱中查找与上述服务调度任务相关联的服务对应的第三标识；基于上述服务调度任务以及上述服务对应的第三标识，生成至少一个服务调度序列；从至少一个上述服务调度序列中确定目标服务调度序列；通知上述设备访问上述目标服务调度序列中第三标识对应的服务。
上述电子设备提到的通信总线可以是外设部件互连标准(Peripheral Component Interconnect，简称PCI)总线或扩展工业标准结构(Extended Industry Standard Architecture，简称EISA)总线等。该通信总线可以分为地址总线、数据总线、控制总线等。为便于表示，图中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
通信接口用于上述电子设备与其他设备之间的通信。
存储器可以包括随机存取存储器(Random Access Memory，简称RAM)，也可以包括非易失性存储器(non-volatile memory)，例如至少一个磁盘存储器。可选的，存储器还可以是至少一个位于远离前述处理器的存储装置。
上述的处理器可以是通用处理器，包括中央处理器(Central Processing  Unit，简称CPU)、网络处理器(Network Processor，简称NP)等；还可以是数字信号处理器(Digital Signal Processing，简称DSP)、专用集成电路(Application Specific Integrated Circuit，简称ASIC)、现场可编程门阵列(Field－Programmable Gate Array，简称FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。
在本发明提供的又一实施例中，还提供了一种存储介质，该存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述实施例中任一上述的服务调度方法。
在本发明提供的又一实施例中，还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述实施例中任一上述的服务调度方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。上述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行上述计算机程序指令时，全部或部分地产生按照本发明实施例上述的流程或功能。上述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。上述计算机指令可以存储在存储介质中，或者从一个存储介质向另一个存储介质传输，例如，上述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。上述存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。上述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘Solid State Disk(SSD))等。
需要说明的是，在本文中，诸如第一和第二等之类的关系术语仅仅用来将一个实体或者操作与另一个实体或操作区分开来，而不一定要求或者暗示这些实体或操作之间存在任何这种实际的关系或者顺序。而且，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包 括一系列要素的过程、方法、物品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括上述要素的过程、方法、物品或者设备中还存在另外的相同要素。
本说明书中的各个实施例均采用相关的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于***实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例的部分说明即可。
以上上述仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围。凡在本发明的精神和原则之内所作的任何修改、等同替换、改进等，均包含在本发明的保护范围内。

Claims (10)

  1. 一种服务调度方法，其中，所述方法包括：
    获取服务调度任务，其中，所述服务调度任务由服务请求对应的第一标识，以及接收所述服务请求的设备对应的第二标识组成；
    在预设的服务调度知识图谱中查找与所述服务调度任务相关联的服务对应的第三标识；
    基于所述服务调度任务以及所述服务对应的第三标识，生成至少一个服务调度序列；
    从至少一个所述服务调度序列中确定目标服务调度序列；
    通知所述设备访问所述目标服务调度序列中第三标识对应的服务。
  2. 根据权利要求1所述的方法，其中，所述从至少一个所述服务调度序列中确定目标服务调度序列，包括：
    计算至少一个所述服务调度序列对应的调度值；
    基于所述调度值从至少一个所述服务调度序列中确定目标服务调度序列。
  3. 根据权利要求2所述的方法，其中，所述计算至少一个所述服务调度序列对应的调度值，包括：
    获取至少一个所述服务调度序列中第一标识对应的服务请求的重要度，第二标识对应的设备的利用率，以及第三标识对应的服务的占有率；
    将所述重要度、所述利用率以及所述占有率输入预设的调度值计算模型，以使所述调度值计算模型输出调度值。
  4. 根据权利要求3所述的方法，其中，所述调度值计算模型，包括：
    DV＝I*A+F*B+U*C；
    其中，所述DV为调度值，所述I为重要度，所述F为利用率，所述U为占有率，所述A为重要度对应的权重，所述B为利用率对应的权重，所述C为占有率对应的权重。
  5. 根据权利要求2所述的方法，其中，所述基于所述调度值从至少一个所述服务调度序列中确定目标服务调度序列，包括：
    计算所述调度值与预设调度值阈值之间的差值；
    基于所述差值从至少一个所述服务调度序列中确定目标服务调度序列。
  6. 根据权利要求5所述的方法，其中，所述基于所述差值从至少一个所述服务调度序列中确定目标服务调度序列，包括：
    从至少一个所述服务调度序列中，确定最小差值对应的服务调度序列为目标服务调度序列。
  7. 根据权利要求1所述的方法，其中，所述获取服务调度任务，包括：
    基于服务调度任务的生成时刻，从服务调度任务集中获取服务调度任务。
  8. 一种服务调度装置，其中，所述装置包括：
    任务获取模块，用于获取服务调度任务，其中，所述服务调度任务由服务请求对应的第一标识，以及接收所述服务请求的设备对应的第二标识组成；
    标识查找模块，用于在预设的服务调度知识图谱中查找与所述服务调度任务相关联的服务对应的第三标识；
    序列生成模块，用于基于所述服务调度任务以及所述服务对应的第三标识，生成至少一个服务调度序列；
    序列确定模块，用于从至少一个所述服务调度序列中确定目标服务调度序列；
    设备通知模块，用于通知所述设备访问所述目标服务调度序列中第三标识对应的服务。
  9. 一种电子设备，其中，包括处理器、通信接口、存储器和通信总线，其中，处理器，通信接口，存储器通过通信总线完成相互间的通信；
    存储器，用于存放计算机程序；
    处理器，用于执行存储器上所存放的程序时，实现权利要求1-7中任一所述的方法步骤。
  10. 一种存储介质，其上存储有计算机程序，其中，该程序被处理器执行时实现如权利要求1-7中任一所述的方法。
PCT/CN2020/125932 2020-01-16 2020-11-02 服务调度方法、装置、电子设备及存储介质 WO2021143287A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20914465.8A EP4092529A4 (en) 2020-01-16 2020-11-02 SERVICE SCHEDULING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND STORAGE MEDIA
US17/793,567 US20230063202A1 (en) 2020-01-16 2020-11-02 Method and Apparatus for Scheduling Service, Electronic Device, and Storage Medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010048710.7A CN111274012B (zh) 2020-01-16 2020-01-16 服务调度方法、装置、电子设备及存储介质
CN202010048710.7 2020-01-16

Publications (1)

Publication Number Publication Date
WO2021143287A1 true WO2021143287A1 (zh) 2021-07-22

Family

ID=70997320

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/125932 WO2021143287A1 (zh) 2020-01-16 2020-11-02 服务调度方法、装置、电子设备及存储介质

Country Status (4)

Country Link
US (1) US20230063202A1 (zh)
EP (1) EP4092529A4 (zh)
CN (1) CN111274012B (zh)
WO (1) WO2021143287A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113887083A (zh) * 2021-10-29 2022-01-04 北京明略软件***有限公司 一种空调调度优化方法、***、计算机设备和存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111274012B (zh) * 2020-01-16 2022-07-12 珠海格力电器股份有限公司 服务调度方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050283782A1 (en) * 2004-06-17 2005-12-22 Platform Computing Corporation Job-centric scheduling in a grid environment
CN106572187A (zh) * 2016-11-11 2017-04-19 三维通信股份有限公司 一种云制造服务调度方法和***
CN109375992A (zh) * 2018-08-17 2019-02-22 华为技术有限公司 一种资源调度方法及装置
CN109995817A (zh) * 2017-12-29 2019-07-09 中移信息技术有限公司 一种服务调度方法及装置
CN111274012A (zh) * 2020-01-16 2020-06-12 珠海格力电器股份有限公司 服务调度方法、装置、电子设备及存储介质

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080281904A1 (en) * 2007-05-11 2008-11-13 Va Software Corporation Associating service listings with open source projects
EP2219321A1 (en) * 2009-02-04 2010-08-18 Nokia Corporation Scheduling of dynamically multiplexed services in a wireless network
CN105589945A (zh) * 2015-12-17 2016-05-18 华为技术有限公司 一种知识库构建方法、控制器
CN107168788B (zh) * 2016-03-07 2021-01-08 阿里巴巴集团控股有限公司 分布式***中资源的调度方法以及装置
CN106027344A (zh) * 2016-07-05 2016-10-12 吴本刚 基于大数据的家居服务***
CN109857551B (zh) * 2019-01-09 2023-12-19 平安科技（深圳）有限公司 基于云计算的服务资源的调度方法及装置、电子设备
US10949261B2 (en) * 2019-03-27 2021-03-16 Intel Corporation Automated resource provisioning using double-blinded hardware recommendations
CN110661879B (zh) * 2019-10-12 2023-03-24 北京奇艺世纪科技有限公司 节点调度方法、装置、***、调度服务器及终端设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050283782A1 (en) * 2004-06-17 2005-12-22 Platform Computing Corporation Job-centric scheduling in a grid environment
CN106572187A (zh) * 2016-11-11 2017-04-19 三维通信股份有限公司 一种云制造服务调度方法和***
CN109995817A (zh) * 2017-12-29 2019-07-09 中移信息技术有限公司 一种服务调度方法及装置
CN109375992A (zh) * 2018-08-17 2019-02-22 华为技术有限公司 一种资源调度方法及装置
CN111274012A (zh) * 2020-01-16 2020-06-12 珠海格力电器股份有限公司 服务调度方法、装置、电子设备及存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4092529A4 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113887083A (zh) * 2021-10-29 2022-01-04 北京明略软件***有限公司 一种空调调度优化方法、***、计算机设备和存储介质

Also Published As

Publication number Publication date
EP4092529A1 (en) 2022-11-23
EP4092529A4 (en) 2023-05-10
US20230063202A1 (en) 2023-03-02
CN111274012A (zh) 2020-06-12
CN111274012B (zh) 2022-07-12

Similar Documents

Publication Publication Date Title
US9207988B2 (en) Method, system, and device for managing server hardware resources in a cloud scheduling environment
WO2021143287A1 (zh) 服务调度方法、装置、电子设备及存储介质
CN109768879B (zh) 目标业务服务器的确定方法、装置及服务器
WO2020073903A1 (zh) 时延敏感网络通信方法及其装置
EP3493485B1 (en) Method, apparatus and system for notification
WO2019075662A1 (zh) 一种网关多连接的方法及装置
WO2017045450A1 (zh) 资源的操作处理方法及装置
WO2020125074A1 (zh) 消息到达率确定方法、装置、数据统计服务器及存储介质
US20210399986A1 (en) Data communication method, server device, client device and medium
CN110875983B (zh) 终端业务质量的评估方法、装置、设备及介质
CN113127693B (zh) 一种流量数据包统计方法、装置、设备及存储介质
CN109392196B (zh) 基于移动终端的大数据分析方法及***
CN108156086B (zh) 一种策略规则下发方法及装置
CN111400327B (zh) 一种数据同步方法、装置、电子设备及存储介质
CN112073215A (zh) 一种实现应用的方法及业务控制器
CN113918504A (zh) 一种隔离组的实现方法及装置
CN113380241A (zh) 语义交互的调整方法、装置、语音设备及存储介质
CN112860432A (zh) 一种进程管理方法、装置及服务器
CN110891028B (zh) 确定负载均衡策略的方法、装置及存储介质
CN111163088B (zh) 消息处理方法、***、装置及电子设备
CN110944033B (zh) 设备控制方法、装置、边缘层服务器、***及存储介质
WO2024036456A1 (zh) 一种基于人工智能ai提供服务的方法、装置、设备及存储介质
CN110856148B (zh) 一种基于5g通信的数据传输方法、***、装置及介质
US11456889B2 (en) Information notification method, apparatus, and system
EP4044555A1 (en) Method for transmitting cross-resource event notification, electronic device, system and computer-readable storage medium

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20914465

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020914465

Country of ref document: EP

Effective date: 20220816