reserved. Amazon Trademark Deploy GluonCV Models GluonCV Models MXNet Computational Graph Json Acyclic Graph Export As-is Optimize with TVM© 2019, Amazon Web Services, Inc. or its Affiliates. All

System Overview Relay IR Graph Annotation with Your Annotator Graph Partitioning Your Codegen LLVM, CUDA, Metal, VTA Serialized Subgraph Library Relay Runtime (VM, Graph Runtime, Interpreter) Mark supported operators or subgraphs 1. Implement an operator-level annotator, OR 2. Implement a graph-level annotator© 2019, Amazon Web Services, Inc. or its Affiliates. All rights reserved. Option 1: rights reserved. Option 2: Graph-Level Annotation ● Implement a Relay IR visitor to annotate a subgraph ● Module path: python/tvm/relay/op/contrib//graph_annotator.py ● Apply the annotator

for non-template-based output; it accepts strings, bytes, and dictionaries (dicts will be encoded as JSON). Many methods in RequestHandler are designed to be overridden in subclasses and be used throughout form arguments with other types of input. In particular, we do not parse JSON request bodies. Applications that wish to use JSON instead of form-encoding may override prepare to parse their requests: 24 request.headers.get("Content-Type", "").startswith("application/json"): self.json_args = json.loads(self.request.body) else: self.json_args = None Overriding RequestHandler methods In addition to get()/post()/etc

for non-template-based output; it accepts strings, bytes, and dictionaries (dicts will be encoded as JSON). Many methods in RequestHandler are designed to be overridden in subclasses and be used throughout form arguments with other types of input. In particular, we do not parse JSON request bodies. Applications that wish to use JSON instead of form-encoding may override prepare to parse their requests: def headers.get("Content-Type", "").startswith("application/json"): self.json_args = json.loads(self.request.body) else: self.json_args = None Overriding RequestHandler methods In addition

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 120CHAPTER 11. TYPES 121 • There is no meaningful 11.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 120CHAPTER 11. TYPES 121 • There is no meaningful 11.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite