Idle computing power

1.

1、 The bank can loan the idle computing resources to indivials or enterprises

the computing power resources here include software and hardware, mainly in the following two cases

1. With computing power software resources, without hardware resources, the computing power output mode of software and hardware cooperation in computing power bank can be realized. The tenth power itself is a server rental sales background, there are a lot of servers and other computing hardware resources, so you can avoid the cost of purchasing hardware equipment

2. There are no computing power software and hardware resources, only one computing power result is required. The computing power bank outputs computing power results for users through the existing built computing power platform resources, or provides VIP computing power output customization scheme for users

Second, indivials and enterprises have surplus computing resources, which can be stored in the computing bank to dispatch the demand side of computing power, and then share the rewards to the depositors according to the actual situation

If an enterprise has idle servers and other computing hardware resources, it can also sublet them in the computing bank to share the rent. Or it can be converted into computing services

2. Last year, I went to do a total double eyelid surgery and open the inner corner of the eye. The Japanese style of plastic surgery is more natural, the surgical wound is very small. It was done by Dr. Sato Yingming at that time. Dr. Sato was very friendly and had a good chat ring the face-to-face visit. He would not have the airs of a famous doctor.

3. Yes, there's a tourist express in zengcuolong police car. It's 10 yuan per person.

4. Atom chain (ATOS) is a financial solution based on the decentralization of blockchain. Its goal is to build a global currency free circulation system through blockchain and distributed ledger technology
this system allows each user to conct international financial transactions freely

the atomic chain adopts a five layer architecture: data layer, network layer, consensus layer, contract layer and application layer
the data layer uses the distributed ledger technology to realize currency issuance, payment, exchange and other operations

network layer: a peer-to-peer network based on P2P protocol

consensus layer: Based on POD and BFT consensus algorithm

Contract layer adopts Genesis contract and multilingual intelligent contract to issue and manage currency, optimizes virtual machine, supports Turing completion, and adopts introspection mechanism to prevent deadlock in Turing completion

application layer: it is friendly to various types of terminals and convenient for developers to develop applications based on atomic chain. Through the form of decentralized autonomy, we can build a diversified financial circulation network to enhance the liquidity, security and universality of money

blockchain is the core supporting technology of digital cryptocurrency system represented by bitcoin. The core advantage of blockchain technology is decentralization. It can realize point-to-point transaction, coordination and cooperation based on decentralized credit in a distributed system without mutual trust by means of data encryption, time stamp, distributed consensus and economic incentive, so as to solve the common high cost, low cost and low cost of centralized institutions Low efficiency and data storage insecurity provide solutions
the application fields of blockchain include digital currency, token, finance, anti-counterfeiting traceability, privacy protection, supply chain, entertainment, etc. with the popularity of blockchain and bitcoin, many related top domain names have been registered, which has a great impact on the domain name instry< As a monetary unit in a win-win environment, ATOS aims to become a universal currency for international transactions. Atomic chain as an open system, users can develop a variety of independent DAPP based on the atomic chain API, and establish personalized application scenarios.

5. It's a good idea, but even if you calculate the data step by step, and then combine the data, you must connect multiple devices before. Since you want to connect, there is a problem of delay. Even if it's very small, there is still some, which is of little significance

6.
capacity Scheler supports the following features:
(1) Computing power guarantee. Support multiple queues, a job can be submitted to a queue. Each queue is configured with a certain proportion of computing resources, and all jobs submitted to the queue share the resources in the queue< br />(2) Flexibility. Idle resources will be allocated to those queues that do not reach the upper limit of resource usage. When a queue that does not reach the upper limit of resource needs resources, once there are idle resources, they will be allocated< br />(3) Priority is supported. Queue supports job priority scheling (FIFO by default)
(4) Multiple leases. Considering a variety of constraints to prevent a single job, user or queue from monopolizing the resources in the queue or cluster< br />(5) Resource based scheling. It supports resource intensive jobs, allows jobs to use more resources than the default value, and can accommodate jobs with different resource requirements. However, only memory resource scheling is currently supported< br />3. Analysis of computing power scheler algorithm
3.1 The variables involved
in capacity, there are three kinds of granularity objects: queue, job and task. They all need to maintain some information:
(1) Queue maintenance information
@ queuename: the name of the queue
@ ulmin: the minimum amount of resources available for each user (all users are the same), which needs to be specified by the user in the configuration file
@ capacitypercent: to calculate the resource proportion, and
@ numjobsbyuser: the workload of each user in the configuration file to track the workload submitted by each user, And limit the quantity
attributes of map or rec task in the queue:
@ capacity: the actual amount of computing resources, which changes dynamically with the number of slots in the tasktracker (users may be adding or recing machine nodes), The size is: capacitypercent * mapclustercapacity / 100
@ numrunningtasks: the number of running tasks
@ numslotsoccupied: the total number of slots occupied by running tasks. Note that in the capacity Scheler, running tasks and slots do not necessarily correspond one by one, and each task can obtain multiple slots, mainly because the scheling supports memory resource scheling, A task may require the amount of memory contained in multiple slots
@ numslotsoccupiedbyuser: the total number of slots occupied by each user's job is used to limit the amount of resources used by users< br />(2) Job maintenance information
priority: job priority, divided into five levels, from large to small in order: very_ HIGH，HIGH，NORMAL，LOW，VERY_ LOW;
nummaptasks / numrecetasks: the total number of map / rec tasks of the job
runningmaptasks / runningmaptasks: the number of map / rec tasks that the job is running
finishedmaptasks / finishedrecetasks: the number of map / rec tasks that the job has completed
...
(3) Task maintenance information
task start time, current status, etc.
3.2 Computing power scheling algorithm
when there is an idle slot on a tasktracker, the scheler selects a queue, a job in the selected queue, and a task in the selected job in turn, and assigns the slot to the task. The following describes the strategy used to select queue, job and task:
(1) Select queue: sort all the queues according to the resource utilization (Num slots occupied / capacity) from small to large, and process them in turn until a suitable job is found< br />2 Select job: in the current queue, all jobs are sorted according to the job submission time and job priority (assuming that priority scheling function is enabled, which is not supported by default and needs to be enabled in the configuration file). Scheling considers each job in turn, Select a job that meets two conditions: [1] the user where the job is located does not reach the upper limit of resource utilization [2] the node where the tasktracker is located has enough memory for the task of the job< br />3 Select a task. Like most schelers, consider the locality and resource usage of the task That is: call the obtainnewmaptask() / obtainnewrecetask() method in jobinprogress)
in summary, the pseudo code of fair scheler is:
/ / capacitytasks cheler:trackTracker When a free slot appears, find the appropriate task for the slot

List & lt; Task> assignTasks(TaskTrackerStatus taskTracker) {

sortQueuesByResourcesUsesage(queues);< br />
for queue:queues {

7. There is no suspense, you need to know the specific information to know. Generally speaking, in this specific case, we can understand the detailed rules.