| { | |
| "paper_id": "2021", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T14:10:35.292337Z" | |
| }, | |
| "title": "An Architecture for Accelerated Large-Scale Inference of Transformer-Based Language Models", | |
| "authors": [ | |
| { | |
| "first": "Amir", | |
| "middle": [], | |
| "last": "Ganiev", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Wattpad Toronto", | |
| "location": { | |
| "region": "ON", | |
| "country": "Canada" | |
| } | |
| }, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "Colt", | |
| "middle": [], | |
| "last": "Chapin", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Wattpad Toronto", | |
| "location": { | |
| "region": "ON", | |
| "country": "Canada" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Anderson", | |
| "middle": [], | |
| "last": "De Andrade", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Wattpad Toronto", | |
| "location": { | |
| "region": "ON", | |
| "country": "Canada" | |
| } | |
| }, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "Chen", | |
| "middle": [], | |
| "last": "Liu", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Wattpad Toronto", | |
| "location": { | |
| "region": "ON", | |
| "country": "Canada" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This work demonstrates the development process of a machine learning architecture for inference that can scale to a large volume of requests. In our experiments, we used a BERT model that was fine-tuned for emotion analysis, returning a probability distribution of emotions given a paragraph. The model was deployed as a gRPC service on Kubernetes. Apache Spark was used to perform inference in batches by calling the service. We encountered some performance and concurrency challenges and created solutions to achieve faster running time. Starting with 3.3 successful inference requests per second, we were able to achieve as high as 300 successful requests per second with the same batch job resource allocation. As a result, we successfully stored emotion probabilities for 95 million paragraphs within 96 hours.", | |
| "pdf_parse": { | |
| "paper_id": "2021", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This work demonstrates the development process of a machine learning architecture for inference that can scale to a large volume of requests. In our experiments, we used a BERT model that was fine-tuned for emotion analysis, returning a probability distribution of emotions given a paragraph. The model was deployed as a gRPC service on Kubernetes. Apache Spark was used to perform inference in batches by calling the service. We encountered some performance and concurrency challenges and created solutions to achieve faster running time. Starting with 3.3 successful inference requests per second, we were able to achieve as high as 300 successful requests per second with the same batch job resource allocation. As a result, we successfully stored emotion probabilities for 95 million paragraphs within 96 hours.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "As data in organizations becomes more available for analysis, it is crucial to develop efficient machine learning pipelines. Previous work (Al-Jarrah et al., 2015) has highlighted the growing number of data centers and their energy and pollution repercussions. Machine learning models that require less computational resources to generate accurate results reduce these externalities. On the other hand, many machine learning applications also require results in nearly real-time in order to be viable and may also require results from as many data samples as possible in order to produce accurate insights. Hence, there are also opportunity costs associated with missed service-level objectives.", | |
| "cite_spans": [ | |
| { | |
| "start": 139, | |
| "end": 163, | |
| "text": "(Al-Jarrah et al., 2015)", | |
| "ref_id": "BIBREF1" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "Attention-based language models such as BERT (Devlin et al., 2019) are often chosen for their relative efficiency, and empirical power. Compared to recurrent neural networks (Hochreiter and Schmidhuber, 1997) , each step in a transformer layer (Vaswani et al., 2017) has direct access to all * Work done while the author was working at Wattpad. other steps and can be computed in parallel, which can make both training and inference faster. BERT also easily accommodates different applications by allowing the fine-tuning of its parameters on different tasks. Despite these benefits, exposing these models and communicating with them efficiently possesses some challenges.", | |
| "cite_spans": [ | |
| { | |
| "start": 45, | |
| "end": 66, | |
| "text": "(Devlin et al., 2019)", | |
| "ref_id": "BIBREF2" | |
| }, | |
| { | |
| "start": 174, | |
| "end": 208, | |
| "text": "(Hochreiter and Schmidhuber, 1997)", | |
| "ref_id": "BIBREF6" | |
| }, | |
| { | |
| "start": 244, | |
| "end": 266, | |
| "text": "(Vaswani et al., 2017)", | |
| "ref_id": "BIBREF11" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "Machine learning frameworks are often used to train, evaluate, and perform inference on predictive models. TensorFlow (Abadi et al., 2016) has been shown to be a reliable system that can operate at a large scale. A sub-component called Tensor-Flow Serving allows loading models as services that handle inference requests concurrently.", | |
| "cite_spans": [ | |
| { | |
| "start": 118, | |
| "end": 138, | |
| "text": "(Abadi et al., 2016)", | |
| "ref_id": "BIBREF0" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "System architectures for inference have changed over time. Initial approaches favored offline settings where batch jobs make use of distributed platforms to load models and data within the same process and perform inference. For example, Ijari, 2017 suggested an architecture that uses Apache Hadoop (Hadoop, 2006) and Apache Pig for largescale data processing, where results are written to a Hadoop Distributed File System (HDFS) for later consumption. Newer distributed platforms such as Apache Spark (Zaharia et al., 2016) have gained prominence because of their memory optimizations and more versatile APIs, compared to Apache Hadoop (Zaharia et al., 2012) .", | |
| "cite_spans": [ | |
| { | |
| "start": 238, | |
| "end": 249, | |
| "text": "Ijari, 2017", | |
| "ref_id": "BIBREF7" | |
| }, | |
| { | |
| "start": 300, | |
| "end": 314, | |
| "text": "(Hadoop, 2006)", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 503, | |
| "end": 525, | |
| "text": "(Zaharia et al., 2016)", | |
| "ref_id": "BIBREF13" | |
| }, | |
| { | |
| "start": 638, | |
| "end": 660, | |
| "text": "(Zaharia et al., 2012)", | |
| "ref_id": "BIBREF12" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "As part of this architecture, inference services would often be reserved for applications that require faster responses. The batch-based and service-based platforms have different use cases and often run in isolation. Collocating data and models in a batch job has some disadvantages. Loading models in the same process as the data forces them both to scale the same way. Moreover, models are forced to be implemented using the programming languages supported by the distributed data platform. Their APIs often place some limitations on what can be done.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "With the evolution of machine learning frame-works and container-orchestration systems such as Kubernetes, 1 it is now simpler to efficiently build, deploy, and scale models as services. A scalable architecture was presented in (G\u00f3mez et al., 2014) that proposes the use of RESTful API calls executed by batch jobs in Hadoop to reach online services that provide real-time inference. Approaches like this simplify the architecture and address the issues discussed previously.", | |
| "cite_spans": [ | |
| { | |
| "start": 228, | |
| "end": 248, | |
| "text": "(G\u00f3mez et al., 2014)", | |
| "ref_id": "BIBREF4" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "In this work, we present an architecture for batch inference where a data processing task relies on external services to perform the computation. The components of the architecture will be discussed in detail along with the technical challenges and solutions we developed to accelerate this process. Our application is a model for emotion analysis that produces a probability distribution over a closed set of emotions given a paragraph of text (Liu et al., 2019) . We present benchmarks to justify our architecture decisions and settings. The proposed architecture is able to generate results for 95 million paragraphs within 96 hours.", | |
| "cite_spans": [ | |
| { | |
| "start": 445, | |
| "end": 463, | |
| "text": "(Liu et al., 2019)", | |
| "ref_id": "BIBREF8" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "We deployed our model as a TensorFlow service in a Kubernetes cluster. A sidecar service preprocessed and vectorized paragraphs and forwarded requests to this service. We used gRPC to communicate with the services, 2 which is an efficient communication protocol on HTTP/2. Both nearly realtime and offline use cases made calls to these services. We used Apache Spark for batch processing, which we ran on Amazon's AWS EMR service. 3 Our batch job was developed using Apache Spark's Python API (PySpark). The batch job fetched a dataset of relevant paragraphs, called the inference service, and stored the results. The job had two modes: a backfill mode and a daily mode, which ran on a subset of mutated and new paragraphs. This batch job was part of a data pipeline, scheduled using Apache AirFlow 4 and Luigi. 5 Figure 1 shows the main components of this architecture.", | |
| "cite_spans": [ | |
| { | |
| "start": 431, | |
| "end": 432, | |
| "text": "3", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 814, | |
| "end": 822, | |
| "text": "Figure 1", | |
| "ref_id": "FIGREF0" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Architecture design", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "One of the key issues we faced in scaling up our inference services was the growing size of the memory footprint of an instance. A standard practice when conducting model inference at scale in a MapReduce program such as Apache Spark is to broadcast an instance of the model to each distributed worker process to allow for parallel processing. However, when the footprint of these instances becomes too large, they begin to compete with the dataset being processed for the limited memory resources of the underlying cluster and, in many cases, exceeding the capacity of the underlying hardware.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Kubernetes vs. Apache Spark", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "While this issue does not preclude the use of Apache Spark for running inferences on large models at scale, it does complicate the process of implementing the job in a cost-efficient manner. It is possible to allocate more resources, but because the clusters are static in size, a lot of work has to go into properly calculating resource allocation to avoid over or under-provisioning. This is where the idea of offloading the model to Kubernetes comes into play.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Kubernetes vs. Apache Spark", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "While our MapReduce clusters struggled to scale and accommodate the larger models being broadcasted, by leveraging Kubernetes we were able to monitor and optimize resource usage as well as define autoscaling behaviors independently of this cluster. That said, while there are clear benefits to isolating your model from your MapReduce job we must now consider the added overhead of the network calls and the effort to build and maintain containerized services.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Kubernetes vs. Apache Spark", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "To ensure optimal resource usage, we provisioned a segregated node pool dedicated to hosting instances of our models. A node pool is a collection of similar resources with predefined autoscaling behaviors. We leveraged Kubernetes' builtin taint/toleration functionality to establish the required behavior. In Kubernetes, Taints designate resources as non-viable for allocation, unless deployments are specifically annotated as having a Toleration for said Taint. For this node pool, we selected instance types that offer faster CPUs, but provide an adequate amount of memory to load our models.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Kubernetes node pool", | |
| "sec_num": "2.2" | |
| }, | |
| { | |
| "text": "Once we made the decision to deploy our model as a service, we had to determine which network protocol to use. While representational state transfer (REST) (Pautasso et al., 2013 ) is a well-known standard, there were two aspects of our use case that made us consider alternatives. The first is that architecturally, our use case was far more functional in nature than REST. Second, the nature of our data means that request messages can be large. It was for this reason that we found the efficiency offered by the Protobuf protocol a natural fit for our use case. 6 Having decided to use gRPC and Protobuf, we encountered two issues. First, gRPC uses the HTTP/2 protocol which multiplexes requests over a single persistent TCP connection. Because of this persistent connection, Layer-4 load balancers that can only route connections are not able to recognize requests within them that could be balanced across multiple replicas of a service. To enable this, we rely on a Layer-7 load balancer which is able to maintain persistent connections with all devices, and identify and route requests within these channels accordingly.", | |
| "cite_spans": [ | |
| { | |
| "start": 156, | |
| "end": 178, | |
| "text": "(Pautasso et al., 2013", | |
| "ref_id": "BIBREF10" | |
| }, | |
| { | |
| "start": 565, | |
| "end": 566, | |
| "text": "6", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "REST vs. gRPC", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "The second issue was organizational in nature. REST is a widely accepted standard, but more importantly, it is a protocol that developers are familiar with. The introduction of a different API design has led to significant friction of adoption.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "REST vs. gRPC", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "The AWS EMR cluster needed to be configured to run a Apache Spark job that makes 95 million inference calls to our micro-service. Due to the unbounded nature of these paragraphs, which can become quite large in our use case, these 95 million records require a significant amount of disk space (in the order of terabytes).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "AWS EMR cluster configuration", | |
| "sec_num": "2.4" | |
| }, | |
| { | |
| "text": "Taking into account the cost constraints of this project, we chose an AWS r5.xlarge instance with 200 GiB of disk space as a master node, and 5 AWS r5.4xlarge instances with 1,000 GiB of disk space each, as worker nodes. This configuration ensures that there is enough disk capacity to process the data and the number of cores is as high as possible without exceeding the cost constraints. Additionaly, we selected these to be memory-optimized to ensure we provide the job with enough RAM to efficiently process our joins.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "AWS EMR cluster configuration", | |
| "sec_num": "2.4" | |
| }, | |
| { | |
| "text": "The EMR cluster configuration is kept constant as a controlled variable throughout the project and in all of our experiments. This ensures that only the implementation changes affect the performance of the inference job.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "AWS EMR cluster configuration", | |
| "sec_num": "2.4" | |
| }, | |
| { | |
| "text": "There were two different solutions that monitor different aspects of the proposed architecture: Apache Spark console and DataDog. AWS EMR provided access to the Apache Spark console for its running tasks and a history server for completed tasks. The console displays the execution plan, the running stage, the number of partitions completed in that stage, the number of stages left to execute, as well as statistics and message logs of our inference job. Success or failure of this job and its pipeline was reported using DataDog. 7 DataDog is a cloud based monitoring service that provides helpful visualization tools to monitor applications.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Monitoring", | |
| "sec_num": "2.5" | |
| }, | |
| { | |
| "text": "Additionally, our services were instrumented to report the number, latency, and status code of all calls received. We made use of DataDog to aggregate and monitor these metrics. In our implementation, the instrumentation was handled by functional wrappers around our endpoint handlers, as well as a synchronous gRPC Interceptor for the client on our sidecar service. Figure 2 shows an example of our request count on our daily job. Figure 2 : DataDog visualization of a daily job, consisting of 600,000 paragraphs calls to the service. The X-axis is the local time starting at 1 a.m. The Y-axis is the total number of calls executed within 1 minute. The highlighted vertical bar shows that 18,000 calls were executed within 1 minute (300 per second) at 1:54 a.m. The calls started at around 1 a.m. and reached a peak speed at around 1:40 a.m.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 367, | |
| "end": 375, | |
| "text": "Figure 2", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 432, | |
| "end": 440, | |
| "text": "Figure 2", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Monitoring", | |
| "sec_num": "2.5" | |
| }, | |
| { | |
| "text": "Our initial approach, which used the configuration in the previous section, was resilient to failures but performed slowly at around 4 requests per second during the inference step. With a backfill target of 95 million paragraphs, running this job was intractable. Our investigations concluded that the issues were rooted in a low request pressure on the backend services. Thus, the sections below describe the steps taken to address these issues and speed up the inference process.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Architecture optimization", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "Our autoscaling group consisted of instances with Intel's Xeon Platinum 8175M CPUs and 64 GB of RAM. The use of GPUs is not cost-effective without a proper batching mechanism, which is considered to be outside of the scope of this work. Each instance had 8 physical cores and 16 logical cores. To reduce the memory footprint but also allow a fine-grained resource allocation, Kubernetes pods had a limit of 2 physical cores. In our experiments, pods did not consume more than 4 GB of memory under heavy load. Network utilization remained well under 10 Gb/s. We set up an autoscaling policy with a target CPU utilization of 70%.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Scaling model service", | |
| "sec_num": "3.1" | |
| }, | |
| { | |
| "text": "With a maximum number of 100 pods (25 instances), we achieved a maximum of 300 requests per second, each request being a paragraph with at least 15 characters. Our daily job usually finished within 60 minutes.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Scaling model service", | |
| "sec_num": "3.1" | |
| }, | |
| { | |
| "text": "We evaluated the performance of TensorFlow Serving with multiple parameter configurations. The", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Tuning TensorFlow Serving parameters", | |
| "sec_num": "3.2" | |
| }, | |
| { | |
| "text": "Intra only settings that tangibly impacted performance included: enabling Intel's Math Kernel Library (MKL), the OpenMP number of threads for MKL, and the thread pool size for TensorFlow intraoperations. We used TensorFlow Serving version 2.3.0, which uses MKL-DNN version 0.21. Table 1 illustrates performance under different configurations for pods with 2 CPU physical cores and 4 logical cores. In particular, we note that disabling MKL and allocating a thread pool the size of the number of logical cores gave us the best performance for this model.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 279, | |
| "end": 287, | |
| "text": "Table 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "MKL OpenMP", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Configuring parameters of TensorFlow serving and successfully scaling up BERT micro-service allowed for a faster inference speed. However, adjusting the service alone did not yield better results as the speed remained relatively similar (3.3 complete calls per second). Therefore, a PySpark job reached its limits in the proposed configuration. The microservice was not receiving enough requests to trigger its autoscaling condition and capped out at 7 pods (far short of our max off 100). To address this, we sought to introduce more load by increasing the rate at which the client makes calls to the microservice. Using synchronous calls, the number of requests the batch job can make is bounded by the number of cores assigned to it. Since the computation is done by the service, these cores will be mostly waiting for the service responses.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Spark job tuning", | |
| "sec_num": "3.3" | |
| }, | |
| { | |
| "text": "To address Python's synchronous nature limiting the rate at which a single core can make calls to the service, we leveraged the AsyncIO library 8 within a PySpark User Defined Function (UDF), which allowed a single core to implement quasiconcurrent calls and leverage the idle thread awaiting a response. Since AsyncIO was utilized, the gRPC AsyncIO API 9 was imported instead of default gRPC. The async gRPC is compatible with AsyncIO and can create asynchronous channels. Exceptions or errors returned by the call were accessed with grpc.aio.AioRpcError method.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Spark job tuning", | |
| "sec_num": "3.3" | |
| }, | |
| { | |
| "text": "Even with everything above implemented within the PySpark UDF, it was not possible to take advantage of AsyncIO yet. By default, a vanilla PySpark UDF receives only one tabular row at a time containing one paragraph. That means that the Asyn-cIO loop within the UDF was not be able to execute concurrent calls if only one paragraph was available. Apache Spark's Vectorized UDFs (Pandas UDFs) allows us to process partitions in batches and achieve the desired level of concurrency. Each batch is represented in memory using the Apache Arrow format and accessible with the Pandas API.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Spark job tuning", | |
| "sec_num": "3.3" | |
| }, | |
| { | |
| "text": "Apache Arrow is an in-memory columnar data format that facilitates the transference of data between the JVM (Java virtual machine), which runs the Apache Spark job, and Python processes (i.e. Pandas UDFs). It offers zero-copy reads between processes for data access without serialization overhead. In our work, a scalar Pandas UDF was defined to receive paragraphs as a Pandas Series and return a probability distribution of the emotion classes for each paragraph, as a new Pandas Series. 10 With Python AsyncIO, gRPC Async, and Pandas UDFs using Apache Arrow, the load created by the client (PySpark job) substantially increased. AsyncIO ensured that extra paragraphs were sent to the server while waiting to receive emotion probabilities for outstanding calls. However, as soon as the first one thousand calls were sent to the server (in a matter of seconds), the PySpark job failed. The errors received by the client were canceled, unavailable or the deadline was exceeded (more about gRPC errors in section 3.4). That indicated that the client actually created too much load on the server causing it to respond with errors. The Kubernetes Deployment was overwhelmed and did not have enough time to scale up the micro-service. This led to unavailable and deadline errors.", | |
| "cite_spans": [ | |
| { | |
| "start": 489, | |
| "end": 491, | |
| "text": "10", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Spark job tuning", | |
| "sec_num": "3.3" | |
| }, | |
| { | |
| "text": "To limit the maximum number of concur-9 https://grpc.github.io/grpc/python/ grpc_asyncio.html 10 https://spark.apache.org/docs/latest/ api/python/user_guide/arrow_pandas.html", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Spark job tuning", | |
| "sec_num": "3.3" | |
| }, | |
| { | |
| "text": "Responses Per Second 10 170 25 256.7 50 298.3 75 Service upscaling fails rent calls to the service we utilized Semaphore. Semaphore is a class in the AsyncIO library 11 that implements an internal counter (set by user) to limit the number of concurrent requests as described by Dijkstra, 1968 . Number of concurrent requests running in each core can never exceed the maximum Semaphore counter value.", | |
| "cite_spans": [ | |
| { | |
| "start": 285, | |
| "end": 299, | |
| "text": "Dijkstra, 1968", | |
| "ref_id": "BIBREF3" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 14, | |
| "end": 55, | |
| "text": "Second 10 170 25 256.7 50 298.3 75", | |
| "ref_id": "TABREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Semaphore Value", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "To identify the maximum Semaphore value that successfully scales up the number of Kubernetes pods without errors, we conducted tests. Results of the experiments are shown in Table 2 .", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 174, | |
| "end": 181, | |
| "text": "Table 2", | |
| "ref_id": "TABREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Semaphore Value", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "With the Semaphore value set to 50, PySpark ran successfully and significantly increased the load set by the client to the server. Table 3 summarizes all libraries and tools used to increase the number of calls per second.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 131, | |
| "end": 138, | |
| "text": "Table 3", | |
| "ref_id": "TABREF3" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Semaphore Value", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "As gRPC async calls were made to the service, errors were returned. The most common gRPC response status code exceptions 12 encountered were: cancelled, unavailable, and deadline exceeded. We expected to receive errors when the service was scaling to process the received requests. When an error was received by a running PySpark client, the running job would terminate. Thus, we were unable to produce inference results without a solution that handles errors and keeps running the Spark job.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Errors during gRPC calls", | |
| "sec_num": "3.4" | |
| }, | |
| { | |
| "text": "A Circuit Breaker (Nygard, 2018) was implemented to prevent clients from overwhelming services and a gRPC Interceptor was implemented to wait for services to be available and retry failing calls. Table 4 shows the total number of requests made and the number of errors that were handled by the circuit breaker. ", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 196, | |
| "end": 203, | |
| "text": "Table 4", | |
| "ref_id": "TABREF4" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Errors during gRPC calls", | |
| "sec_num": "3.4" | |
| }, | |
| { | |
| "text": "A circuit breaker is a software design pattern that was implemented to detect and act upon response failures received by the PySpark client. As discussed in Nygard, 2018, in a closed state the circuit passes through and all gRPC calls are being made. If a number of consecutive failures are received, the circuit opens and subsequent request attempts return a failure immediately. After a time period, the circuit switches to a half-open state to test if the underlying problem still exists. If a call fails in this half-open state, the breaker is once again tripped. When a call finally succeeds, the circuit breaker resets back to the default closed state. The circuit breaker implementation was taken from an open-source library. 13 Modifications were made to support AsyncIO, so calls running through it are sent concurrently. The state of the circuit breaker is shared across requests that use the the same gRPC client. To open or close the circuit, the circuit breaker only considers the deadline exceeded, unavailable, and cancelled gRPC status codes. Other errors are directly returned to the client.", | |
| "cite_spans": [ | |
| { | |
| "start": 733, | |
| "end": 735, | |
| "text": "13", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Asynchronous circuit breaker", | |
| "sec_num": "3.5" | |
| }, | |
| { | |
| "text": "Finally, a gRPC Interceptor uses this circuit breaker to block requests until the circuit breaker is closed again and retry each request up to 4 times, after which the data point is skipped and the batch job continues. The interceptor gets attached to the gRPC channel on creation. This design pat-13 https://github.com/fabfuel/ circuitbreaker tern allows clients to not overwhelm services with requests and halts our batch job as the service deployment scales up.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Asynchronous circuit breaker", | |
| "sec_num": "3.5" | |
| }, | |
| { | |
| "text": "All steps in Section 3 improve the batch job speed and results in satisfactory performance. The data pipeline is able to produce inference results for more than 95 million paragraphs in around 96 hours with an inference speed of around 300 requests per second. The semaphore value is set to 50.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Results", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "Once the backfill data is stored, the data pipeline runs daily to find new and updated paragraphs from our S3 datasets. Everyday, around 600,000 (varies daily) paragraphs need to have their inference values stored. The graph in Figure 2 illustrates the typical daily run for the pipeline. It shows that it takes about 40 minutes for the Kubernetes micro-service pods to fully scale up. We limited the maximum number of pods for daily jobs to 100.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 228, | |
| "end": 236, | |
| "text": "Figure 2", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Daily runs of the batch job", | |
| "sec_num": "4.1" | |
| }, | |
| { | |
| "text": "Inference results were stored in an AWS S3 bucket. This dataset was registered in a AWS Glue Data Catalog. 14 Amazon Athena 15 is a query service that made it possible to run SQL queries on this dataset. Redash 16 is a cloud-based analytics dashboard that we used to visualize insights from the inference results. In includes a SQL client that makes calls to Amazon Athena and displays the query results. Redash was connected to Amazon Athena as a data source, which enabled us to perform queries to all tables registered in AWS Glue.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Analytics platform", | |
| "sec_num": "4.2" | |
| }, | |
| { | |
| "text": "This paper discussed a successful machine learning architecture for both online and offline inference that centralizes models as services. We present solutions that use concurrency to increase the inference speed of offline batch jobs in Apache Spark. Because of this, the majority of resources are still assigned to these services, and the batch job resources grow at a much smaller rate in comparison.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "We used a resource-intensive language model for emotion classification, where we demonstrated how proper tuning of TensorFlow Serving and Kubernetes can improve the service's performance. We also showed that by parallelizing the calls made to the service in PySpark, we can significantly improve inference speed.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "Finally, results were presented that provide useful insights into the inference performance. Together, all these components resulted in a satisfactory architecture, which resulted in the emotion probabilities of 95 million paragraphs to be stored within 96 hours. We hope the architecture can be applied to other language tasks or machine learning models.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "https://kubernetes.io 2 https://grpc.github.io 3 https://aws.amazon.com/emr 4 https://airflow.apache.org 5 https://github.com/spotify/luigi", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "https://developers.google.com/ protocol-buffers", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "https://www.datadoghq.com", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "https://www.python.org", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "https://docs.python.org/3/library 12 https://grpc.github.io/grpc/core/md_ doc_statuscodes.html", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "https://aws.amazon.com/glue 15 https://aws.amazon.com/athena 16 https://redash.io", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Tensorflow: A system for large-scale machine learning", | |
| "authors": [ | |
| { | |
| "first": "Mart\u00edn", | |
| "middle": [], | |
| "last": "Abadi", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Paul", | |
| "middle": [], | |
| "last": "Barham", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jianmin", | |
| "middle": [], | |
| "last": "Chen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Zhifeng", | |
| "middle": [], | |
| "last": "Chen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Andy", | |
| "middle": [], | |
| "last": "Davis", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Dean", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Matthieu", | |
| "middle": [], | |
| "last": "Devin", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Sanjay", | |
| "middle": [], | |
| "last": "Ghemawat", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Geoffrey", | |
| "middle": [], | |
| "last": "Irving", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Michael", | |
| "middle": [], | |
| "last": "Isard", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Manjunath", | |
| "middle": [], | |
| "last": "Kudlur", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Josh", | |
| "middle": [], | |
| "last": "Levenberg", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Rajat", | |
| "middle": [], | |
| "last": "Monga", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Sherry", | |
| "middle": [], | |
| "last": "Moore", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Derek", | |
| "middle": [ | |
| "G" | |
| ], | |
| "last": "Murray", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Benoit", | |
| "middle": [], | |
| "last": "Steiner", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Paul", | |
| "middle": [], | |
| "last": "Tucker", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Vijay", | |
| "middle": [], | |
| "last": "Vasudevan", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Pete", | |
| "middle": [], | |
| "last": "Warden", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Martin", | |
| "middle": [], | |
| "last": "Wicke", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Yuan", | |
| "middle": [], | |
| "last": "Yu", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Xiaoqiang", | |
| "middle": [], | |
| "last": "Zheng", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2016, | |
| "venue": "12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "265--283", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Mart\u00edn Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek G. Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng. 2016. Ten- sorflow: A system for large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pages 265- 283, Savannah, GA. USENIX Association.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Efficient machine learning for big data: A review", | |
| "authors": [ | |
| { | |
| "first": "Y", | |
| "middle": [], | |
| "last": "Omar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Paul", | |
| "middle": [ | |
| "D" | |
| ], | |
| "last": "Al-Jarrah", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Sami", | |
| "middle": [], | |
| "last": "Yoo", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "George", | |
| "middle": [ | |
| "K" | |
| ], | |
| "last": "Muhaidat", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Kamal", | |
| "middle": [], | |
| "last": "Karagiannidis", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Taha", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2015, | |
| "venue": "Big Data Research", | |
| "volume": "2", | |
| "issue": "3", | |
| "pages": "87--93", | |
| "other_ids": { | |
| "DOI": [ | |
| "10.1016/j.bdr.2015.04.001" | |
| ] | |
| }, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Omar Y. Al-Jarrah, Paul D. Yoo, Sami Muhaidat, George K. Karagiannidis, and Kamal Taha. 2015. Efficient machine learning for big data: A review. Big Data Research, 2(3):87-93.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Bert: Pre-training of deep bidirectional transformers for language understanding", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Devlin", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Ming-Wei", | |
| "middle": [], | |
| "last": "Chang", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Kenton", | |
| "middle": [], | |
| "last": "Lee", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Kristina", | |
| "middle": [], | |
| "last": "Toutanova", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2019, | |
| "venue": "NAACL-HLT", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "J. Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. Bert: Pre-training of deep bidirec- tional transformers for language understanding. In NAACL-HLT.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Cooperating sequential processes", | |
| "authors": [ | |
| { | |
| "first": "W", | |
| "middle": [], | |
| "last": "Edsger", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Dijkstra", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1968, | |
| "venue": "The origin of concurrent programming", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "65--138", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Edsger W Dijkstra. 1968. Cooperating sequential pro- cesses. In The origin of concurrent programming, pages 65-138. Springer.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "A scalable machine learning online service for big data real-time analysis", | |
| "authors": [ | |
| { | |
| "first": "A", | |
| "middle": [], | |
| "last": "G\u00f3mez", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Esperanza", | |
| "middle": [], | |
| "last": "Albacete", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Y", | |
| "middle": [], | |
| "last": "S\u00e1ez", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "P", | |
| "middle": [ | |
| "I" | |
| ], | |
| "last": "Vi\u00f1uela", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2014, | |
| "venue": "IEEE Symposium on Computational Intelligence in Big Data (CIBD)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1--8", | |
| "other_ids": { | |
| "DOI": [ | |
| "10.1109/CIBD.2014.7011537" | |
| ] | |
| }, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "A. G\u00f3mez, Esperanza Albacete, Y. S\u00e1ez, and P. I. Vi\u00f1uela. 2014. A scalable machine learning on- line service for big data real-time analysis. 2014 IEEE Symposium on Computational Intelligence in Big Data (CIBD), pages 1-8.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Apache hadoop", | |
| "authors": [ | |
| { | |
| "first": "Apache", | |
| "middle": [], | |
| "last": "Hadoop", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2006, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Apache Hadoop. 2006. Apache hadoop.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Long short-term memory", | |
| "authors": [ | |
| { | |
| "first": "Sepp", | |
| "middle": [], | |
| "last": "Hochreiter", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J\u00fcrgen", | |
| "middle": [], | |
| "last": "Schmidhuber", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1997, | |
| "venue": "Neural computation", | |
| "volume": "9", | |
| "issue": "8", | |
| "pages": "1735--1780", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation, 9(8):1735- 1780.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "The study of the large scale twitter on machine learning", | |
| "authors": [ | |
| { | |
| "first": "Abhish", | |
| "middle": [], | |
| "last": "Ijari", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2017, | |
| "venue": "International Research Journal of Engineering and Technology (IRJET)", | |
| "volume": "4", | |
| "issue": "", | |
| "pages": "247--251", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Abhish Ijari. 2017. The study of the large scale twitter on machine learning. International Research Journal of Engineering and Technology (IRJET), 4:247-251.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Dens: a dataset for multi-class emotion analysis", | |
| "authors": [ | |
| { | |
| "first": "Chen", | |
| "middle": [], | |
| "last": "Liu", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Muhammad", | |
| "middle": [], | |
| "last": "Osama", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Anderson De", | |
| "middle": [], | |
| "last": "Andrade", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2019, | |
| "venue": "Proceedings of the EMNLP Conference", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Chen Liu, Muhammad Osama, and Anderson De An- drade. 2019. Dens: a dataset for multi-class emotion analysis. Proceedings of the EMNLP Conference.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "Release it!: design and deploy production-ready software", | |
| "authors": [ | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Michael", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Nygard", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2018, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Michael T Nygard. 2018. Release it!: design and deploy production-ready software. Pragmatic Bookshelf.", | |
| "links": null | |
| }, | |
| "BIBREF10": { | |
| "ref_id": "b10", | |
| "title": "REST: advanced research topics and practical applications", | |
| "authors": [ | |
| { | |
| "first": "Cesare", | |
| "middle": [], | |
| "last": "Pautasso", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Erik", | |
| "middle": [], | |
| "last": "Wilde", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Rosa", | |
| "middle": [], | |
| "last": "Alarcon", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2013, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Cesare Pautasso, Erik Wilde, and Rosa Alarcon. 2013. REST: advanced research topics and practical appli- cations. Springer.", | |
| "links": null | |
| }, | |
| "BIBREF11": { | |
| "ref_id": "b11", | |
| "title": "Attention is all you need", | |
| "authors": [ | |
| { | |
| "first": "Ashish", | |
| "middle": [], | |
| "last": "Vaswani", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Noam", | |
| "middle": [], | |
| "last": "Shazeer", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Niki", | |
| "middle": [], | |
| "last": "Parmar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jakob", | |
| "middle": [], | |
| "last": "Uszkoreit", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Llion", | |
| "middle": [], | |
| "last": "Jones", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Aidan", | |
| "middle": [ | |
| "N" | |
| ], | |
| "last": "Gomez", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Lukasz", | |
| "middle": [], | |
| "last": "Kaiser", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Illia", | |
| "middle": [], | |
| "last": "Polosukhin", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2017, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": { | |
| "arXiv": [ | |
| "arXiv:1706.03762" | |
| ] | |
| }, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. arXiv preprint arXiv:1706.03762.", | |
| "links": null | |
| }, | |
| "BIBREF12": { | |
| "ref_id": "b12", | |
| "title": "Fast and interactive analytics over hadoop data with spark", | |
| "authors": [ | |
| { | |
| "first": "Matei", | |
| "middle": [], | |
| "last": "Zaharia", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Mosharaf", | |
| "middle": [], | |
| "last": "Chowdhury", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Tathagata", | |
| "middle": [], | |
| "last": "Das", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Ankur", | |
| "middle": [], | |
| "last": "Dave", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Justin", | |
| "middle": [], | |
| "last": "Ma", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Murphy", | |
| "middle": [], | |
| "last": "Mccauley", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Franklin", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Scott", | |
| "middle": [], | |
| "last": "Shenker", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Ion", | |
| "middle": [], | |
| "last": "Stoica", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2012, | |
| "venue": "Usenix Login", | |
| "volume": "37", | |
| "issue": "4", | |
| "pages": "45--51", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy Mccauley, M Franklin, Scott Shenker, and Ion Stoica. 2012. Fast and interactive analytics over hadoop data with spark. Usenix Login, 37(4):45-51.", | |
| "links": null | |
| }, | |
| "BIBREF13": { | |
| "ref_id": "b13", | |
| "title": "Apache spark: a unified engine for big data processing", | |
| "authors": [ | |
| { | |
| "first": "Matei", | |
| "middle": [], | |
| "last": "Zaharia", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Reynold", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Xin", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Patrick", | |
| "middle": [], | |
| "last": "Wendell", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Tathagata", | |
| "middle": [], | |
| "last": "Das", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Michael", | |
| "middle": [], | |
| "last": "Armbrust", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Ankur", | |
| "middle": [], | |
| "last": "Dave", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Xiangrui", | |
| "middle": [], | |
| "last": "Meng", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Josh", | |
| "middle": [], | |
| "last": "Rosen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Shivaram", | |
| "middle": [], | |
| "last": "Venkataraman", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Michael", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Franklin", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2016, | |
| "venue": "Communications of the ACM", | |
| "volume": "59", | |
| "issue": "11", | |
| "pages": "56--65", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Matei Zaharia, Reynold S Xin, Patrick Wendell, Tatha- gata Das, Michael Armbrust, Ankur Dave, Xian- grui Meng, Josh Rosen, Shivaram Venkataraman, Michael J Franklin, et al. 2016. Apache spark: a unified engine for big data processing. Communica- tions of the ACM, 59(11):56-65.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "type_str": "figure", | |
| "text": "Architecture overview.", | |
| "num": null, | |
| "uris": null | |
| }, | |
| "TABREF1": { | |
| "content": "<table/>", | |
| "text": "Achieved number of successful gRPC calls per second vs Semaphore value. EMR configuration, table partitions, and paragraphs are kept constant.", | |
| "html": null, | |
| "num": null, | |
| "type_str": "table" | |
| }, | |
| "TABREF3": { | |
| "content": "<table><tr><td>Code Status</td><td>Notes</td></tr></table>", | |
| "text": "All libraries, design patterns, and data formats imported to PySpark job to accelerate inference speed.", | |
| "html": null, | |
| "num": null, | |
| "type_str": "table" | |
| }, | |
| "TABREF4": { | |
| "content": "<table/>", | |
| "text": "Number of status codes returned in gRPC responses for the entire batch job.", | |
| "html": null, | |
| "num": null, | |
| "type_str": "table" | |
| } | |
| } | |
| } | |
| } |