<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.li-coinrg-compute-resource-scheduling" target="https://datatracker.ietf.org/doc/html/draft-li-coinrg-compute-resource-scheduling-00">
   <front>
      <title>A Compute Resources Oriented Scheduling Mechanism based on Dataplane Programmability</title>
      <author initials="Z." surname="Li" fullname="Zhiqiang Li">
         <organization>China Mobile</organization>
      </author>
      <author initials="K." surname="Yao" fullname="Kehan Yao">
         <organization>China Mobile</organization>
      </author>
      <author initials="Y." surname="Li" fullname="Yang Li">
         <organization>China Mobile</organization>
      </author>
      <date month="October" day="23" year="2021" />
      <abstract>
	 <t>   With massive data growing in the internet, how to effectively use the
   compute resources has become a quite hot topic.  In order to cool
   down the pressure in today&#x27;s large data centers, some compute
   resources have been moved towards the edge, gradually forming a
   distributed Compute Force Network.  Force is a physical cause which
   can change the state of a motion or an object.  We refer the
   definition from physics and extend its philosophy to network that in
   future, the network can be a compute force which can facilitate the
   integration of different kinds of compute resources, no matter
   hardware or software, making the computation fast and effective.  In
   this draft, we present a compute resources oriented scheduling
   mechanism based on dataplane programmability, which can effectively
   schedule and manage compute resources in the network.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-li-coinrg-compute-resource-scheduling-00" />
   
</reference>
