CN111930331B - Information display method and device, electronic equipment and computer readable medium - Google Patents

Information display method and device, electronic equipment and computer readable medium Download PDF

Info

Publication number
CN111930331B
CN111930331B CN202011011924.3A CN202011011924A CN111930331B CN 111930331 B CN111930331 B CN 111930331B CN 202011011924 A CN202011011924 A CN 202011011924A CN 111930331 B CN111930331 B CN 111930331B
Authority
CN
China
Prior art keywords
server node
information
presented
node information
value
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN202011011924.3A
Other languages
Chinese (zh)
Other versions
CN111930331A (en
Inventor
刘然
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Hongli Intellectual Property Service Co ltd
Original Assignee
Beijing Missfresh Ecommerce Co Ltd
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 Beijing Missfresh Ecommerce Co Ltd filed Critical Beijing Missfresh Ecommerce Co Ltd
Priority to CN202011011924.3A priority Critical patent/CN111930331B/en
Publication of CN111930331A publication Critical patent/CN111930331A/en
Application granted granted Critical
Publication of CN111930331B publication Critical patent/CN111930331B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/14Digital output to display device ; Cooperation and interconnection of the display device with other functional units
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/957Browsing optimisation, e.g. caching or content distillation

Abstract

The embodiment of the disclosure discloses an information display method, an information display device, electronic equipment and a computer readable medium. One embodiment of the method comprises: generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented comprises a binary set, and the binary set comprises a dimension name and an index value corresponding to the dimension name in the index value set; carrying out fragmentation processing on each information to be presented in the information set to be presented so as to generate fragmented information to be presented, and obtaining a fragmented information set to be presented; and sending the information set to be presented of the fragment to a display terminal. This embodiment improves the transmission efficiency of data.

Description

Information display method and device, electronic equipment and computer readable medium
Technical Field
Embodiments of the present disclosure relate to the field of computer technologies, and in particular, to an information display method and apparatus, an electronic device, and a computer-readable medium.
Background
Information display is a technology for outputting data in a visible or readable form from a memory inside or outside a system. Currently, a common information display method is that a server storing data requested by a user directly transmits the data requested by the user to a display terminal of the user.
However, when the information display is performed in the above manner, the following technical problems often exist:
firstly, a single server is adopted for data transmission and all data are transmitted at one time, so that the data transmission efficiency is low;
secondly, the working state of the server and the link state between the server and the user display terminal are not comprehensively considered, so that the determined number of the fragments is fixed, and the use efficiency of the server is not high;
thirdly, it is difficult to perform task allocation to the server according to the working state of the server itself and the link state between the server and the user display terminal, resulting in a problem that the server may have data congestion and network congestion when transmitting data. The data blocking means that data cannot be sent in time due to server congestion.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose information display methods, apparatuses, electronic devices, and computer readable media to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide an information display method, including: generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value; carrying out fragmentation processing on each information to be presented in the information set to be presented to generate fragmented information to be presented, and obtaining a fragmented information set to be presented; and sending the information set to be presented in the fragments to a display terminal.
In some embodiments, the determining a number of tiles based on the server node information set and the information to be presented comprises:
determining the number of slices by the following formula:
Figure 562237DEST_PATH_IMAGE001
wherein the content of the first and second substances,
Figure 10536DEST_PATH_IMAGE002
representing the number of server node information in the server node information set;
Figure 118169DEST_PATH_IMAGE003
represents a serial number;
Figure 795269DEST_PATH_IMAGE004
represents a serial number;
Figure 875221DEST_PATH_IMAGE005
represents a serial number;
Figure 494421DEST_PATH_IMAGE006
representing server node information;
Figure 27033DEST_PATH_IMAGE007
a server node state value indicating that the server node information includes;
Figure 773404DEST_PATH_IMAGE008
indicating a link state value included in the server node information;
Figure 973441DEST_PATH_IMAGE009
indicating that the server node information set is first
Figure 497963DEST_PATH_IMAGE003
The server node information includes a server node state value;
Figure 986713DEST_PATH_IMAGE010
indicating that the server node information set is first
Figure 254884DEST_PATH_IMAGE003
The link state value included in the individual server node information;
Figure 71878DEST_PATH_IMAGE011
indicating that the server node information set is first
Figure 298460DEST_PATH_IMAGE004
The server node information includes a server node state value;
Figure 71244DEST_PATH_IMAGE012
indicating that the server node information set is first
Figure 877526DEST_PATH_IMAGE005
The link state value included in the individual server node information;
Figure 255418DEST_PATH_IMAGE013
representing the maximum value in the server node state values included in the information of each server node in the server node information set;
Figure 138054DEST_PATH_IMAGE014
representing the maximum value in the link state values included in the information of each server node in the server node information set;
Figure 398135DEST_PATH_IMAGE015
representing the information length of the information to be presented;
Figure 8107DEST_PATH_IMAGE016
represents a first preset weight with a value range of
Figure 240506DEST_PATH_IMAGE017
Figure 808890DEST_PATH_IMAGE018
Indicating the number of slices.
In some embodiments, the determining a bearer capability value of a server node corresponding to each server node information in the server node information set includes:
determining the bearing capacity value of the server node corresponding to each piece of server node information in the server node information set by the following formula:
Figure 41420DEST_PATH_IMAGE019
wherein the content of the first and second substances,
Figure 658346DEST_PATH_IMAGE020
representing a second preset weight, wherein the value range is (0, 1);
Figure 807567DEST_PATH_IMAGE021
represents a third preset weight with a value range of
Figure 281274DEST_PATH_IMAGE022
Figure 453629DEST_PATH_IMAGE023
Represents a serial number;
Figure 405405DEST_PATH_IMAGE007
a server node state value indicating that the server node information includes;
Figure 425445DEST_PATH_IMAGE008
indicating link state values included in server node information
Figure 70053DEST_PATH_IMAGE009
Indicating that the server node information set is first
Figure 729704DEST_PATH_IMAGE003
The server node information includes a server node state value;
Figure 750750DEST_PATH_IMAGE010
indicating that the server node information set is first
Figure 343405DEST_PATH_IMAGE003
The link state value included in the individual server node information;
Figure 362177DEST_PATH_IMAGE024
representing the server node;
Figure 56594DEST_PATH_IMAGE025
the server node state value included in the server node information corresponding to the server node in the server node information set is represented;
Figure 881331DEST_PATH_IMAGE026
indicating a link state value included in server node information corresponding to the server node in the server node information set;
Figure 594072DEST_PATH_IMAGE027
representing the load bearing capacity value.
In a second aspect, some embodiments of the present disclosure provide an information display apparatus, the apparatus comprising: a generating unit, configured to generate an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, where the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value; the fragment processing unit is configured to perform fragment processing on each piece of information to be presented in the information set to be presented to generate fragment information to be presented, so as to obtain a fragment information set to be presented; and the sending unit is configured to send the information set to be presented of the fragments to a display terminal.
In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon which, when executed by one or more processors, cause the one or more processors to implement the method as described in the first aspect.
In a fourth aspect, some embodiments of the disclosure provide a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method as described in the first aspect.
The above embodiments of the present disclosure have the following advantages: firstly, generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the region name, the preset time period value, the sales rate value and the return rate value. And the data are combined, so that the next step of fragmentation is facilitated. Secondly, carrying out fragmentation processing on each information to be presented in the information set to be presented to generate fragmented information to be presented, and obtaining a fragmented information set to be presented. And carrying out fragmentation processing on the information to be presented, and carrying out data preparation for the next information transmission. And finally, sending the information set to be presented of the fragments to a display terminal. The problem of low data transmission efficiency caused by overlarge data quantity probably existing when the data requested by the user is integrally sent to the display terminal of the user is solved.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
FIG. 1 is a schematic diagram of an application scenario of an information display method according to some embodiments of the present disclosure;
FIG. 2 is a flow diagram of some embodiments of an information display method according to the present disclosure;
FIG. 3 is a flow diagram of further embodiments of an information display method according to the present disclosure;
FIG. 4 is a schematic structural diagram of some embodiments of an information display method according to the present disclosure;
FIG. 5 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic view of an application scenario of an information display method according to some embodiments of the present disclosure.
In the application scenario diagram of fig. 1, first, the computing device 101 may generate a to-be-presented information set 104 based on a pre-obtained dimension name set 102 and a pre-obtained index value set 103, where the to-be-presented information includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the region name, the preset time period value, the sales rate value and the return rate value. Secondly, the computing device 101 may perform fragmentation processing on each to-be-presented information in the to-be-presented information set 104 to generate fragmented to-be-presented information, resulting in a fragmented to-be-presented information set 105. Finally, the computing device 101 may send the fragmented information to be presented set 105 to the display terminal 106.
The computing device 101 may be hardware or software. When the computing device is hardware, it may be implemented as a distributed cluster composed of multiple servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices enumerated above. It may be implemented, for example, as multiple pieces of software and software modules used to provide distributed services, or as a single piece of software or software module. And is not particularly limited herein.
It should be understood that the number of computing devices in FIG. 1 is merely illustrative. There may be any number of computing devices, as implementation needs dictate.
With continued reference to fig. 2, a flow 200 of some embodiments of an information display method according to the present disclosure is shown. The method may be performed by the computing device 101 of fig. 1. The information display method comprises the following steps:
step 201, generating an information set to be presented based on the pre-acquired dimension name set and the pre-acquired index value set.
In some embodiments, an executing subject of the information display method (e.g., the computing device 101 shown in fig. 1) may generate a set of information to be presented based on a pre-acquired set of dimension names and a pre-acquired set of index values. The information to be presented comprises a binary set, and the binary set comprises a dimension name and an index value corresponding to the dimension name in the index value set. The dimension name may be at least one of: the index value can be at least one of the following: the region name, the preset time period value, the sales rate value and the return rate value.
By way of example, the set of dimension names may be [ region, time, sales rate, return rate ]. The index value set may be [ [ 2020 + 2021, 12%, 10% ] in the central China ], and [ 2020 + 2021, 11%, 15% ] in the north China ]. The set of information to be presented may be [ [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ], [ region: north China, time: 2020 + 2021, sales rate: 11%, return rate: 15% ] ].
Step 202, performing fragmentation processing on each information to be presented in the information set to be presented to generate fragmented information to be presented, so as to obtain a fragmented information set to be presented.
In some embodiments, the executing body may perform fragmentation processing on each piece of information to be presented in the information set to be presented to generate fragmented information to be presented, so as to obtain a fragmented information set to be presented. The slicing processing refers to dividing the information to be presented into a plurality of data segments. Each piece of information to be presented included in the information set to be presented may be regarded as information to be presented in a sub-segment, so as to obtain information to be presented in a segment. The information to be presented in the fragments comprises a plurality of pieces of information to be presented in sub-fragments. As an example, the information set to be presented may be [ [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ], [ region: north China, time: 2020 + 2021, sales rate: 11%, return rate: 15% ] ]. Wherein, each binary group set included by the information to be presented in the information set to be presented includes 4 binary groups. The information set to be presented in the fragment can be obtained as [ [ region: central China ], [ time: 2020 and 2021, sales rate: 12% ], [ return rate: 10% ], [ [ region: north china ], [ time: 2020 and 2021, sales rate: 11% ], [ return rate: 15% ] ].
And step 203, sending the fragmented information set to be presented to the display terminal.
In some embodiments, the sending, by the execution main body, the fragmented information set to be presented to the display terminal may include the following steps:
firstly, the information set to be presented in the fragments is sent to a display terminal in a mode of sending the information set to be presented in the fragments one by one. The method for sending the information to be presented of the fragments one by one further comprises the step of sending the information to be presented of each sub-fragment in the information to be presented of the fragments to be sent to the display terminal in parallel through a plurality of servers.
The above embodiments of the present disclosure have the following advantages: firstly, generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented comprises a binary group, and the binary group comprises a dimension name and an index value corresponding to the dimension name in the index value set. And the data are combined, so that the next step of fragmentation is facilitated. Secondly, carrying out fragmentation processing on each information to be presented in the information set to be presented to generate fragmented information to be presented, and obtaining a fragmented information set to be presented. And carrying out fragmentation processing on the information to be presented, and carrying out data preparation for the next information transmission. And finally, sending the information set to be presented of the fragments to a display terminal. The problem of low data transmission efficiency caused by overlarge data quantity probably existing when the data requested by the user is integrally sent to the display terminal of the user is solved.
With further reference to fig. 3, a flow diagram 300 of further embodiments of an information display method according to the present disclosure is shown. The above-described method may be performed by the computing device 101 of fig. 1. The information display method comprises the following steps:
step 301, generating an information set to be presented based on the pre-acquired dimension name set and the pre-acquired index value set.
In some embodiments, the specific implementation of step 301 and the technical effect brought by the implementation may refer to step 201 in those embodiments corresponding to fig. 2, and are not described herein again.
Step 302, a server node information set is obtained.
In some embodiments, the execution subject may obtain the server node information set through a wired connection or a wireless connection. Wherein, the server node information includes but is not limited to at least one of the following: a server node state value, a link state value. The server node state value is used for representing the working state of the server, and the link state value is used for representing the state of a link from the server node corresponding to the server node information to the display terminal of the user.
As an example, the server node status values may be 2 (characterizing the server is working properly), 1 (characterizing the server part module is working abnormally). The link state values may be 2 (characterizing link clear) and 1 (characterizing link partially blocked).
Step 303, determining the number of fragments based on the server node information set and the information to be presented.
In some embodiments, the execution subject may determine the number of fragments based on the server node information set and the information to be presented.
As an example, the number of slices may be determined by the following formula:
Figure 518165DEST_PATH_IMAGE028
wherein the content of the first and second substances,
Figure 949147DEST_PATH_IMAGE002
and the number of the server node information in the server node information set is represented.
Figure 62727DEST_PATH_IMAGE015
The information length may refer to the number of the tuples in the tuple set included in the information to be presented.
Figure 895554DEST_PATH_IMAGE018
Indicating the number of slices.
As an example, the number of server node information in the above-described server node information set may be 2. The information to be presented may be [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ], the information to be presented comprises 4 tuples in the set of tuples. The number of slices can be determined to be 2 by the above formula (the calculation process is as follows).
Figure 990549DEST_PATH_IMAGE029
In some optional implementations of some embodiments, the executing agent may determine the number of pieces based on the server node information set and the information to be presented and the following formula:
Figure 908827DEST_PATH_IMAGE030
wherein the content of the first and second substances,
Figure 75366DEST_PATH_IMAGE002
indicating the number of server node information in the server node information set.
Figure 247852DEST_PATH_IMAGE003
Indicating a serial number.
Figure 779328DEST_PATH_IMAGE004
Indicating a serial number.
Figure 919322DEST_PATH_IMAGE005
Indicating a serial number.
Figure 889552DEST_PATH_IMAGE006
Representing server node information.
Figure 634654DEST_PATH_IMAGE007
Indicating the server node status value that the server node information includes.
Figure 133769DEST_PATH_IMAGE008
Indicating the link state values included in the server node information.
Figure 777371DEST_PATH_IMAGE009
Indicating the server node information set
Figure 223396DEST_PATH_IMAGE003
The individual server node information includes a server node status value.
Figure 619742DEST_PATH_IMAGE010
Indicating the server node information set
Figure 555337DEST_PATH_IMAGE003
The individual server node information includes a link state value.
Figure 873186DEST_PATH_IMAGE011
Indicating the server node information set
Figure 654060DEST_PATH_IMAGE004
The individual server node information includes a server node status value.
Figure 186804DEST_PATH_IMAGE012
Indicating the server node information set
Figure 230983DEST_PATH_IMAGE005
The individual server node information includes a link state value.
Figure 832866DEST_PATH_IMAGE013
And the maximum value of the server node state values included in the server node information of each server node information set is represented.
Figure 683010DEST_PATH_IMAGE014
And represents the maximum value of the link state values included in the information of each server node in the server node information set.
Figure 53948DEST_PATH_IMAGE015
And the information length of the information to be presented is represented.
Figure 269029DEST_PATH_IMAGE016
Represents a first preset weight with a value range of
Figure 108940DEST_PATH_IMAGE031
Figure 497196DEST_PATH_IMAGE018
Indicating the number of slices.
As an example, the server node information set may be [ (1, 2), (1, 1), (2, 2), (2, 1), (2, 2), (1, 1), (1, 1), (2, 2), (2, 2) ]. The maximum value of the link state values included in the server node information sets is 2, and the maximum value of the server node state values included in the server node information sets is 2. The first preset weight may be 2. The information to be presented may be [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ], wherein the information to be presented comprises 4 tuples in the set of tuples. The number of slices was determined to be 4 by the above formula (calculation as follows).
Figure 925903DEST_PATH_IMAGE032
The above formula is used as an invention point of the embodiment of the present disclosure, thereby solving the second technical problem mentioned in the background art, that is, "the working state of the server itself and the link state between the server and the user display terminal are not comprehensively considered, so that the determined number of the segments is fixed, and the use efficiency of the server is not high". In order to solve the above-mentioned problem of the second technical problem, first, it is convenient to quantify the state of each server node by digitizing the server state and the link state of each server node. Secondly, by introduction
Figure 108623DEST_PATH_IMAGE033
Therefore, the influence of the link state and the server node state on the working state of the server can be comprehensively considered. In addition thereto, by introduction
Figure 950677DEST_PATH_IMAGE034
Thereby enabling the relative operating status of each server to be determined. In addition, the working state of the server is dynamically changed, and the number of the fragments corresponding to each piece of information to be presented is determined according to the ratio of the information length of the information to be presented to the working state of each server. Therefore, the number of the fragments can be dynamically determined according to the state of the server, and then the method is improvedThe utilization efficiency of the server is improved. In addition, the above formula also introduces a first preset weight (characterizing the number of backup servers). Furthermore, a certain amount of servers can be reserved for disaster recovery, and the stability of data transmission is guaranteed. Finally, the problem mentioned in the technical problem two is solved.
And 304, performing uniform fragmentation processing on the information to be presented based on the number of fragments to generate fragmented information to be presented.
In some embodiments, the execution subject may perform uniform fragmentation processing on the information to be presented based on the number of fragments to generate fragmented information to be presented. The uniform fragmentation can use characters as basic units of fragmentation, and then uniformly fragmenting the information to be presented based on the fragmentation number. The information to be presented in the fragments comprises a quadruplet set, wherein the quadruplet set comprises a front index number, a sub-fragment information to be presented number, sub-fragment information to be presented and a rear index number. The front index number may refer to a number of information to be presented for a sub-fragment in a preceding quadruple adjacent to the quadruple. When the quadruple is the first quadruple in the information to be presented in the slice, the front index number of the quadruple may be represented by-1. The rear index number may refer to a number of information to be presented for a sub-fragment in a rear quadruple adjacent to the quadruple. When the quadruple is the last quadruple in the information to be presented in the slice, the back index number of the quadruple may be represented by-2. The information number to be presented of the sub-segment may be composed of two digits, where the first digit is a position number of the information to be presented in the information set to be presented, and the second digit is a position number of the quadruple in the information to be presented of the sub-segment. The sub-fragment information to be presented refers to the data fragment after the information fragment to be presented is fragmented.
As an example, the number of the segments may be 4, and the information to be presented may be [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ]. The information to be presented comprises 36 characters. The information to be presented is subjected to uniform fragmentation processing to generate fragmented information to be presented [ (-1, 00, "region: huazhong, shi", 01), (00, 01 "interval: 2020-20", 02), (01, 02, "21, sales rate: 12", 04), (02, 03, "%, return rate: 10%", "2) ].
Step 305, based on the server node information set, determining the bearing capacity value of the server node corresponding to each piece of server node information, and obtaining a bearing capacity value set.
In some embodiments, the execution subject may determine, based on the server node information set, a bearer capability value of the server node corresponding to each piece of server node information, to obtain a bearer capability value set.
In some optional implementation manners of some embodiments, the executing entity may determine, based on the server node information set, a bearer capability value of a server node corresponding to each piece of server node information by using the following formula, to obtain a bearer capability value set:
Figure 80307DEST_PATH_IMAGE035
wherein the content of the first and second substances,
Figure 910991DEST_PATH_IMAGE020
and the second preset weight is represented, and the value range is (0, 1).
Figure 795771DEST_PATH_IMAGE021
Represents a third preset weight with a value range of
Figure 797225DEST_PATH_IMAGE036
Figure 527283DEST_PATH_IMAGE023
Indicating a serial number.
Figure 461741DEST_PATH_IMAGE007
Indicating the server node status value that the server node information includes.
Figure 268154DEST_PATH_IMAGE008
Presentation serverThe node information includes link state values.
Figure 756904DEST_PATH_IMAGE037
Indicating the server node information set
Figure 25075DEST_PATH_IMAGE003
The individual server node information includes a server node status value.
Figure 345198DEST_PATH_IMAGE010
Indicating the server node information set
Figure 509463DEST_PATH_IMAGE003
The individual server node information includes a link state value.
Figure 16667DEST_PATH_IMAGE024
Representing the above-mentioned server node.
Figure 104840DEST_PATH_IMAGE025
And a server node status value indicating a server node status value in the server node information corresponding to the server node in the server node information set.
Figure 279470DEST_PATH_IMAGE026
And a link state value indicating a link state of the server node in the server node information corresponding to the server node information set.
Figure 349057DEST_PATH_IMAGE027
Indicating the above load bearing capacity value.
As an example, the above-described server node information set may be [ (1, 2), (1, 1), (2, 2), (2, 1), (2, 2), (1, 1), (1, 1), (2, 2), (2, 2) ]. The second predetermined weight value may be 0.4 and the third predetermined weight value may be 0.6. The load-bearing capacity values set by the above formula were [11.4286%, 7.1429%, 14.2857%, 10.0%, 14.2857%, 7.1429%, 7.1429%, 14.2857%, 14.2857% ], with four decimal places reserved for the calculations.
The above formula is taken as an invention point of the embodiment of the present disclosure, thereby solving the technical problem three mentioned in the background art, that is, "it is difficult to perform task allocation to the server according to the working state of the server itself and the link state between the server and the user display terminal, resulting in the problem that the server may have data blocking and network blocking when sending data. ". In order to solve the third mentioned problem of the technical problem, firstly, the influence of the link state on data transmission is considered, and a link state value is introduced as a parameter, so that the problem of low data transmission efficiency caused by network congestion is relieved to a certain extent. Secondly, the influence of the state value of the server node and the state value of the link on the bearing capacity value is respectively highlighted through a second preset weight and a third preset weight. The third preset weight may be set to be greater than the second preset weight when the link state is heavily considered, and the second preset weight may be set to be greater than the third weight when the server node state is heavily considered. The formula can be changed according to actual requirements, and application scenes are wider. Secondly, by
Figure 874716DEST_PATH_IMAGE038
(characterizing the state of the server) and
Figure 484689DEST_PATH_IMAGE039
and (representing the total state of all the servers) to obtain the carrying capacity value of each server node. Each server node can work at full load, and the problem of data congestion caused by the fact that the server nodes are idle due to small data volume or the server nodes are large in data volume is avoided. Finally, the problems mentioned in the third technical problem are solved.
Step 306, based on the bearing capacity value set, sending each quadruple included in each piece to-be-presented information in the piece to-be-presented information set to each server node.
In some embodiments, the executing entity may send, to each server node, a respective quadruple included in each piece of to-be-presented information in the piece of to-be-presented information set based on the bearer capability value set. And determining the number of the quadruples required to be sent by each server node according to the product value of the bearing capacity value corresponding to each server node and the number of the quadruples. The quadruplets are sent to the server nodes in a random manner. The load capacity value is only used for limiting the number of the quadruples required to be sent by each server node.
And 307, sending each quadruple in each server node to a display terminal in parallel.
In some embodiments, the execution agent may send each quadruple in each server node to the display terminal in parallel. The parallel transmission refers to that each server node simultaneously transmits data on a parallel channel.
And 308, splicing the sub-fragment information to be presented in each quadruple based on the front index number, the sub-fragment information to be presented number and the rear index number in each quadruple to obtain an information set to be presented.
In some embodiments, the execution body may splice the sub-fragment information to be presented in each quadruple based on the front index number, the sub-fragment information to be presented number, and the rear index number in each quadruple, so as to obtain an information set to be presented. The splicing means that when the rear index number of one quadruple is consistent with the number of the information to be presented of the sub-fragments of the other quadruple, the information to be presented of the sub-fragments in the latter quadruple is spliced behind the information to be presented of the sub-fragments in the former quadruple, or when the front index number of one quadruple is consistent with the number of the information to be presented of the sub-fragments of the other quadruple, the information to be presented of the sub-fragments in the former quadruple is spliced behind the information to be presented of the sub-fragments in the latter quadruple.
As an example, each quadruplet may be (01, 02, "21, sales rate: 12", 04), (-1, 00, "district: Wash, time", 01), (02, 03, "%, return rate: 10%", -2), (00, 01 ": 2020-20", 02). And (3) splicing the four tuples to obtain an information set to be presented [ [ region: central region, time: 2020 + 2021, sales rate: 12%, return rate: 10% ] ].
And 309, displaying the information set to be presented on the display terminal.
In some embodiments, the execution subject may display the information set to be presented on a display terminal.
One of the above-described various embodiments of the present disclosure has the following advantageous effects: through the formula in some embodiments of the disclosure, the number of the fragments can be dynamically determined, and meanwhile, the task allocation can be performed according to the state of the server, so that the utilization efficiency of the server is ensured. Specifically, the inventor finds that the number of the fragments is often a fixed value due to the failure of comprehensive consideration of the working state of the server itself and the link state before the terminal is displayed by the user. In addition, because the situation of the server itself cannot be comprehensively considered, the problem that the server cannot process tasks in time due to too much task allocation or the problem that the utilization rate of the server is not high due to too little task allocation often occurs. Based on this, some embodiments of the present disclosure, first, by digitizing the server state and the link state of each server node, make it convenient to quantify the state of each server node. Secondly, by introduction
Figure 717087DEST_PATH_IMAGE040
Therefore, the influence of the link state and the server node state on the working state of the server can be comprehensively considered. In addition thereto, by introduction
Figure 770625DEST_PATH_IMAGE041
Thereby enabling the relative operating status of each server to be determined. In addition, the working state of the server is dynamically changed, and the number of the fragments corresponding to each piece of information to be presented is determined according to the ratio of the information length of the information to be presented to the working state of each server. Therefore, the number of the fragments can be dynamically determined according to the state of the server, and the utilization efficiency of the server is improved. In addition, the above formula also introduces a first preset weight (characterizing the number of backup servers). Further, a certain amount of server use can be leftAnd the stability of data transmission is guaranteed due to disaster tolerance. Finally, the number of the fragments can be dynamically determined. In addition, the influence of the link state on data transmission is also considered, and the link state value is introduced as a parameter, so that the problem of low data transmission efficiency caused by network congestion is relieved to a certain extent. Secondly, the influence of the state value of the server node and the state value of the link on the bearing capacity value is respectively highlighted through a second preset weight and a third preset weight. The third preset weight may be set to be greater than the second preset weight when the link state is heavily considered, and the second preset weight may be set to be greater than the third weight when the server node state is heavily considered. The formula can be changed according to actual requirements, and application scenes are wider. Secondly, by
Figure 518001DEST_PATH_IMAGE042
(characterizing the state of the server) and
Figure 134927DEST_PATH_IMAGE043
and (representing the total state of all the servers) to obtain the carrying capacity value of each server node. Each server node can work at full load, and the problem of data congestion caused by the fact that the server nodes are idle due to small data volume or the server nodes are large in data volume is avoided. Finally, the service efficiency of the server is improved.
With further reference to fig. 4, as an implementation of the above-described method for the above-described figures, the present disclosure provides some embodiments of an information display apparatus, which correspond to those of the method embodiments described above for fig. 2, and which may be applied to various electronic devices. As shown in fig. 4, the information display apparatus 400 of some embodiments includes: a generating unit 401, configured to generate a set of information to be presented based on a pre-obtained dimension name set and a pre-obtained index value set, where the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value; the fragment processing unit 402 is configured to perform fragment processing on each piece of information to be presented in the information set to be presented to generate fragment information to be presented, so as to obtain a fragment information set to be presented; a sending unit 403, configured to send the sliced information to be presented to a display terminal.
It will be understood that the elements described in the apparatus 400 correspond to various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 400 and the units included therein, and will not be described herein again.
Referring now to FIG. 5, a block diagram of an electronic device (e.g., computing device 101 of FIG. 1) 500 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 5, electronic device 500 may include a processing means (e.g., central processing unit, graphics processor, etc.) 501 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage means 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
Generally, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 507 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage devices 508 including, for example, magnetic tape, hard disk, etc.; and a communication device 509. The communication means 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. While fig. 5 illustrates an electronic device 500 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 5 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network via the communication means 509, or installed from the storage means 508, or installed from the ROM 502. The computer program, when executed by the processing device 501, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described above in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the apparatus; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name may be at least one of: the index value can be at least one of the following: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value; carrying out fragmentation processing on each information to be presented in the information set to be presented to generate fragmented information to be presented, and obtaining a fragmented information set to be presented; and sending the information set to be presented in the fragments to a display terminal.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes a generation unit, a fragment processing unit, and a transmission unit. The names of these units do not in some cases form a limitation on the units themselves, and for example, the sending unit may also be described as a "unit sending the above-mentioned fragmented information set to be presented to the display terminal".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (6)

1. An information display method comprising:
generating an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name is at least one of: the system comprises a region, a preset time period, a sales rate and a return rate, wherein the index value is at least one of the following items: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value;
the method for processing the information to be presented in the information set to be presented in the fragmentation mode to generate information to be presented in the fragmentation mode to obtain an information set to be presented in the fragmentation mode, wherein the method for processing the information to be presented in the information set to be presented in the fragmentation mode to generate information to be presented in the fragmentation mode comprises the following steps: acquiring a server node information set; determining the number of fragments based on the server node information set and the information to be presented; based on the number of the fragments, performing fragment processing on the information to be presented to generate fragmented information to be presented;
sending the information set to be presented in the fragments to a display terminal, wherein the sending of the information set to be presented in the fragments to the display terminal comprises: based on the server node information set, determining the bearing capacity value of the server node corresponding to each piece of server node information in the server node information set to obtain a bearing capacity value set; based on the bearing capacity value set, sending each quadruple in the quadruple set included by each piece of information to be presented in the information set to be presented in the pieces to be presented to each server node; and sending each four-tuple in each server node to a display terminal in parallel, wherein the server node information comprises at least one of the following: a server node state value, a link state value;
wherein the determining the number of segments based on the server node information set and the information to be presented comprises:
determining the number of slices by the following formula:
Figure DEST_PATH_IMAGE001
wherein the content of the first and second substances,
Figure 246585DEST_PATH_IMAGE002
representing the number of server node information in the server node information set;
Figure 104557DEST_PATH_IMAGE004
represents a serial number;
Figure DEST_PATH_IMAGE005
represents a serial number;
Figure 636032DEST_PATH_IMAGE006
represents a serial number;
Figure DEST_PATH_IMAGE007
representing server node information;
Figure 916972DEST_PATH_IMAGE008
a server node state value indicating that the server node information includes;
Figure DEST_PATH_IMAGE009
indicating a link state value included in the server node information;
Figure 824885DEST_PATH_IMAGE010
indicating that the server node information set is first
Figure 38829DEST_PATH_IMAGE004
The server node information includes a server node state value;
Figure DEST_PATH_IMAGE011
indicating that the server node information set is first
Figure 741206DEST_PATH_IMAGE004
The link state value included in the individual server node information;
Figure 306179DEST_PATH_IMAGE012
indicating that the server node information set is first
Figure 719581DEST_PATH_IMAGE005
The server node information includes a server node state value;
Figure DEST_PATH_IMAGE013
indicating that the server node information set is first
Figure 53610DEST_PATH_IMAGE006
The link state value included in the individual server node information;
Figure 661309DEST_PATH_IMAGE014
representing the maximum value in the server node state values included in the information of each server node in the server node information set;
Figure DEST_PATH_IMAGE015
representing the maximum value in the link state values included in the information of each server node in the server node information set;
Figure 182420DEST_PATH_IMAGE016
representing the information length of the information to be presented;
Figure DEST_PATH_IMAGE017
represents a first preset weight with a value range of
Figure 166557DEST_PATH_IMAGE018
Figure DEST_PATH_IMAGE019
Representing the number of the fragments;
wherein the determining the load-bearing capacity value of the server node corresponding to each piece of server node information in the server node information set includes:
determining the bearing capacity value of the server node corresponding to each piece of server node information in the server node information set by the following formula:
Figure 785452DEST_PATH_IMAGE020
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE021
representing a second preset weight, wherein the value range is (0, 1);
Figure 32893DEST_PATH_IMAGE022
represents a third preset weight with a value range of
Figure DEST_PATH_IMAGE023
Figure 306880DEST_PATH_IMAGE024
Represents a serial number;
Figure 829128DEST_PATH_IMAGE008
a server node state value indicating that the server node information includes;
Figure 872170DEST_PATH_IMAGE009
indicating link state values included in server node information
Figure 821672DEST_PATH_IMAGE010
Indicating that the server node information set is first
Figure 379692DEST_PATH_IMAGE004
The server node information includes a server node state value;
Figure 204166DEST_PATH_IMAGE011
indicating that the server node information set is first
Figure 101715DEST_PATH_IMAGE004
The link state value included in the individual server node information;
Figure DEST_PATH_IMAGE025
representing the server node;
Figure 690960DEST_PATH_IMAGE026
the server node state value included in the server node information corresponding to the server node in the server node information set is represented;
Figure DEST_PATH_IMAGE027
indicating a link state value included in server node information corresponding to the server node in the server node information set;
Figure 673959DEST_PATH_IMAGE028
representing the load bearing capacity value.
2. The method of claim 1, wherein the slicing the information to be presented to generate sliced information to be presented based on the number of slices comprises:
and based on the number of the fragments, uniformly fragmenting the information to be presented to generate the information to be presented of the fragments, wherein the information to be presented of the fragments comprises a quadruplet set, and the quadruplet set comprises a front index number, a sub-fragment information to be presented number and a rear index number.
3. The method of claim 2, wherein the method further comprises:
splicing the sub-fragment information to be presented in each quadruple based on the front index number, the sub-fragment information to be presented number and the rear index number in each quadruple to obtain the information set to be presented;
and displaying the information set to be presented on a display terminal.
4. An information display apparatus comprising:
the generating unit is configured to generate an information set to be presented based on a pre-acquired dimension name set and a pre-acquired index value set, wherein the information to be presented includes a binary set, the binary set includes a dimension name and an index value corresponding to the dimension name in the index value set, and the dimension name is at least one of: the system comprises a region, a preset time period, a sales rate and a return rate, wherein the index value is at least one of the following items: the method comprises the following steps of (1) area name, preset time period value, sales rate value and return rate value;
a fragment processing unit configured to perform fragment processing on each to-be-presented information in the to-be-presented information set to generate fragment to-be-presented information, and obtain a fragment to-be-presented information set, wherein the fragment processing unit is further configured to: acquiring a server node information set; determining the number of fragments based on the server node information set and the information to be presented; based on the number of the fragments, performing fragment processing on the information to be presented to generate fragmented information to be presented;
a sending unit configured to send the sliced information set to be presented to a display terminal, wherein the sending unit is further configured to: based on the server node information set, determining the bearing capacity value of the server node corresponding to each piece of server node information in the server node information set to obtain a bearing capacity value set; based on the bearing capacity value set, sending each quadruple in the quadruple set included by each piece of information to be presented in the information set to be presented in the pieces to be presented to each server node; and sending each four-tuple in each server node to a display terminal in parallel, wherein the server node information comprises at least one of the following: a server node state value, a link state value; wherein the determining the number of segments based on the server node information set and the information to be presented comprises:
determining the number of slices by the following formula:
Figure DEST_PATH_IMAGE029
wherein the content of the first and second substances,
Figure 6851DEST_PATH_IMAGE002
representing the number of server node information in the server node information set;
Figure 523021DEST_PATH_IMAGE004
represents a serial number;
Figure 876642DEST_PATH_IMAGE005
represents a serial number;
Figure 612517DEST_PATH_IMAGE006
represents a serial number;
Figure 14679DEST_PATH_IMAGE007
representing server node information;
Figure 683558DEST_PATH_IMAGE008
a server node state value indicating that the server node information includes;
Figure 411343DEST_PATH_IMAGE009
indicating a link state value included in the server node information;
Figure 368934DEST_PATH_IMAGE010
indicating that the server node information set is first
Figure 574788DEST_PATH_IMAGE004
The server node information includes a server node state value;
Figure 567015DEST_PATH_IMAGE011
indicating that the server node information set is first
Figure 262438DEST_PATH_IMAGE004
The link state value included in the individual server node information;
Figure 441747DEST_PATH_IMAGE012
indicating that the server node information set is first
Figure 949826DEST_PATH_IMAGE005
The server node information includes a server node state value;
Figure 858876DEST_PATH_IMAGE013
indicating that the server node information set is first
Figure 397305DEST_PATH_IMAGE006
The link state value included in the individual server node information;
Figure 595068DEST_PATH_IMAGE014
representing the maximum value in the server node state values included in the information of each server node in the server node information set;
Figure 142724DEST_PATH_IMAGE015
representing the maximum value in the link state values included in the information of each server node in the server node information set;
Figure 109543DEST_PATH_IMAGE016
representing the information length of the information to be presented;
Figure 84453DEST_PATH_IMAGE017
represents a first preset weight with a value range of
Figure 769512DEST_PATH_IMAGE030
Figure 120859DEST_PATH_IMAGE019
Representing the number of the fragments;
wherein the determining the load-bearing capacity value of the server node corresponding to each piece of server node information in the server node information set includes:
determining the bearing capacity value of the server node corresponding to each piece of server node information in the server node information set by the following formula:
Figure DEST_PATH_IMAGE031
wherein the content of the first and second substances,
Figure 915420DEST_PATH_IMAGE021
representing a second preset weight, wherein the value range is (0, 1);
Figure 123548DEST_PATH_IMAGE022
represents a third preset weight with a value range of
Figure 30324DEST_PATH_IMAGE032
Figure 919782DEST_PATH_IMAGE024
Represents a serial number;
Figure 595614DEST_PATH_IMAGE008
a server node state value indicating that the server node information includes;
Figure 912326DEST_PATH_IMAGE009
indicating link state values included in server node information
Figure 103136DEST_PATH_IMAGE010
Indicating that the server node information set is first
Figure 530706DEST_PATH_IMAGE004
The server node information includes a server node state value;
Figure 326624DEST_PATH_IMAGE011
indicating that the server node information set is first
Figure 876554DEST_PATH_IMAGE004
The link state value included in the individual server node information;
Figure 990878DEST_PATH_IMAGE025
representing the server node;
Figure 222140DEST_PATH_IMAGE026
the server node state value included in the server node information corresponding to the server node in the server node information set is represented;
Figure 669301DEST_PATH_IMAGE027
indicating a link state value included in server node information corresponding to the server node in the server node information set;
Figure 327816DEST_PATH_IMAGE028
representing the load bearing capacity value.
5. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-3.
6. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-3.
CN202011011924.3A 2020-09-24 2020-09-24 Information display method and device, electronic equipment and computer readable medium Active CN111930331B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011011924.3A CN111930331B (en) 2020-09-24 2020-09-24 Information display method and device, electronic equipment and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011011924.3A CN111930331B (en) 2020-09-24 2020-09-24 Information display method and device, electronic equipment and computer readable medium

Publications (2)

Publication Number Publication Date
CN111930331A CN111930331A (en) 2020-11-13
CN111930331B true CN111930331B (en) 2021-02-02

Family

ID=73335113

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011011924.3A Active CN111930331B (en) 2020-09-24 2020-09-24 Information display method and device, electronic equipment and computer readable medium

Country Status (1)

Country Link
CN (1) CN111930331B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112685455B (en) * 2021-03-12 2021-11-23 北京每日优鲜电子商务有限公司 Real-time data classification display method and device, electronic equipment and readable medium

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8584124B2 (en) * 2010-04-20 2013-11-12 Salesforce.Com, Inc. Methods and systems for batch processing in an on-demand service environment
CN104917731B (en) * 2014-03-12 2019-04-26 深圳中兴网信科技有限公司 A kind of data that improve show the method and system of speed, server, browser
CN105976212B (en) * 2016-05-30 2020-02-07 北京京东尚科信息技术有限公司 Commodity display method and device and electronic commerce platform
CN108280767A (en) * 2017-08-28 2018-07-13 平安科技(深圳)有限公司 Method, apparatus, storage medium and the terminal of list cutting
CN108197162B (en) * 2017-12-12 2020-10-16 上海天旦网络科技发展有限公司 System and method for presenting business transaction situation
CN108446305B (en) * 2018-01-30 2020-12-01 上海天旦网络科技发展有限公司 System and method for multi-dimensional statistics of business data
CN110244949B (en) * 2019-05-06 2023-09-05 创新先进技术有限公司 Page information display method and device
CN110221778A (en) * 2019-05-27 2019-09-10 携程计算机技术(上海)有限公司 Processing method, system, storage medium and the electronic equipment of hotel's data
CN110795492B (en) * 2019-11-11 2022-06-14 国网山东省电力公司电力科学研究院 Multi-dimensional rapid processing system for transaction data visual display parameters
CN111563206B (en) * 2020-07-03 2024-01-12 秦皇岛肆拾贰宇数字科技有限公司 Method, device, electronic equipment and medium for displaying object information sequence

Also Published As

Publication number Publication date
CN111930331A (en) 2020-11-13

Similar Documents

Publication Publication Date Title
CN112416632B (en) Event communication method and device, electronic equipment and computer readable medium
CN113722055A (en) Data processing method and device, electronic equipment and computer readable medium
CN111930331B (en) Information display method and device, electronic equipment and computer readable medium
EP4180985A1 (en) File sharing method, apparatus, and system
CN113760498A (en) Message consumption method, device, electronic equipment and computer readable medium
CN114785770A (en) Mirror layer file sending method and device, electronic equipment and computer readable medium
CN114490718A (en) Data output method, data output device, electronic equipment and computer readable medium
CN112163176A (en) Data storage method and device, electronic equipment and computer readable medium
CN114035861A (en) Cluster configuration method and device, electronic equipment and computer readable medium
CN112019406A (en) Flow monitoring method and device, electronic equipment and computer readable medium
CN113760927A (en) Data processing method and device, electronic equipment and computer readable medium
CN112307071A (en) Monitoring data acquisition method and device, electronic equipment and computer readable medium
CN112100211A (en) Data storage method and device, electronic equipment and computer readable medium
CN111984612A (en) Method, device and system for sharing files
CN112817701A (en) Timer processing method and device, electronic equipment and computer readable medium
CN111984613A (en) Method, device and system for sharing files
CN112699111A (en) Report generation method and device, electronic equipment and computer readable medium
CN112685455B (en) Real-time data classification display method and device, electronic equipment and readable medium
CN112235167B (en) Flow alarm method, device, electronic equipment and computer readable medium
CN112200643B (en) Article information pushing method and device, electronic equipment and computer readable medium
CN112804164B (en) Flow information generation method and device, electronic equipment and computer readable medium
CN114826932B (en) Data migration method, device, electronic equipment and computer readable medium
CN112637048B (en) Information sending method, information sending device, electronic equipment and computer readable medium
CN113535428B (en) Method, device, equipment and medium for processing request message and response message
CN113472565B (en) Method, apparatus, device and computer readable medium for expanding server function

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20231110

Address after: 518000, 705, No. 121 Minsheng Avenue, Shangcun Community, Gongming Street, Guangming District, Shenzhen City, Guangdong Province

Patentee after: Shenzhen Hongli Intellectual Property Service Co.,Ltd.

Address before: 100102 room 801, 08 / F, building 7, yard 34, Chuangyuan Road, Chaoyang District, Beijing

Patentee before: BEIJING MISSFRESH E-COMMERCE Co.,Ltd.