检索结果-内蒙古大学图书馆

Balance analysis of many varieties small batch workshop production line

学校读者我要写书评

暂无评论

International Journal of Future Generation Communication and Networking 2015年第9期8卷 69-74页

作者： Ai-Ying, Meng Zhejiang Industry Polytechnic College ShaoxingZhejiang China

Aiming at the present situation of the circular saw blade production workshop, through the research of TMM0106 circular saw blade manual packaging production line production efficiency, the circular saw blade processing production line balance rate and process efficiency are analyzed quantitatively. The existing problems are found and the reason for it is analyzed, to provide theory basis for improving the production efficiency of many varieties small batch production line. © 2015 SERSC.

关键词： batch data processing

ISA-88 works for continuous processes too

学校读者我要写书评

暂无评论

Control (Chicago, Ill)

Control (Chicago, Ill) 2010年第1期23卷 57-57页

作者： Hebert, Dan

ISA88 batch control standard has become the common language to describe batch applications in the process industries. When an ISA88 philosophy is applied to the procedural operations of continuous processes, it is called Modular Procedural Automation (MPA). ISAS8 has defined models and terminology for procedural operations in batch processes, and one of the key aspects of the standard is the ability to run these procedural operations flexibly. MPA uses the ISA88 modules below the unit, such as phases, control and equipment modules. This modularity provides standardization and promotes repeatability and reproducibility across units and sites. It also improves safety, engineering, operator training and the retention of operator knowledge. The ISA88 standard has revolutionized the design, implementation and operation of batch processes.

关键词： batch data processing

From batch to Stream: Automatic Generation of Online Algorithms

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Ziteng Pailoor, Shankara Prakash, Aaryan Wang, Yuepeng Dillig, Işil University of Texas at Austin AustinTX United States Simon Fraser University Burnaby Canada

Online streaming algorithms, tailored for continuous data processing, offer substantial benefits but are often more intricate to design than their offline counterparts. This paper introduces a novel approach for automatically synthesizing online streaming algorithms from their offline versions. In particular, we propose a novel methodology, based on the notion of relational function signature (RFS), for deriving an online algorithm given its offline version. Then, we propose a concrete synthesis algorithm that is an instantiation of the proposed methodology. Our algorithm uses the RFS to decompose the synthesis problem into a set of independent subtasks and uses a combination of symbolic reasoning and search to solve each subproblem. We implement the proposed technique in a new tool called Opera and evaluate it on over 50 tasks spanning two domains: statistical computations and online auctions. Our results show that Opera can automatically derive the online version of the original algorithm for 98% of the tasks. Our experiments also demonstrate that Opera significantly outperforms alternative approaches, including adaptations of SyGuS solvers to this problem as well as two of Opera's own ablations. © 2024, CC BY.

关键词： batch data processing

Sizing of heijunka-controlled production systems with unreliable production processes

学校读者我要写书评

暂无评论

IFIP Advances in Information and Communication Technology

IFIP Advances in Information and Communication Technology 2008年 257卷 11-19页

作者： Lippolt, Christian R. Furmans, Kai Kaiserstraße 12 KarlsruheD 76128 Germany

ISBN: (纸本)9780387772486

Heijunka is the notion to level a production system by removing ups and downs in volume caused by batch processing and customer order fluctuation in order to reach a mixed model production system with a constant flow of parts. We show how to implement lean production principles in systems with unreliable production processes. Process unreliabilities occur because tool machines may have small overall equipment effectiveness. Our present results were derived during performed implementation projects, where supermarketpull-systems had to be dimensioned. In particular, the calculation of required inventory levels is presented which uses analytical mathematical models on the basis of discrete time queuing systems. By considering variable capacities we essentially extend the content of reference [1]. The application of our model is demonstrated by an example. © 2008, IFIP International Federation for Information processing. All rights reserved.

关键词： batch data processing

Bicoptor: Two-round Secure Three-party Non-linear Computation without Preprocessing for Privacy-preserving Machine Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhou, Lijing Wang, Ziyu Cui, Hongrui Song, Qingrui Yu, Yu Huawei Technology Shanghai China Shanghai Jiao Tong University Shanghai China

The overhead of non-linear functions dominates the performance of the secure multiparty computation (MPC) based privacy-preserving machine learning (PPML). This work introduces a family of novel secure three-party computation (3PC) protocols, Bicoptor, which improve the efficiency of evaluating non-linear functions. The basis of Bicoptor is a new sign determination protocol, which relies on a clever use of the truncation protocol proposed in SecureML (S&P 2017). Our 3PC sign determination protocol only requires two communication rounds, and does not involve any preprocessing. Such sign determination protocol is well-suited for computing non-linear functions in PPML, e.g. the activation function ReLU, Maxpool, and their variants. We develop suitable protocols for these non-linear functions, which form a family of GPU-friendly protocols, Bicoptor. All Bicoptor protocols only require two communication rounds without preprocessing. We evaluate Bicoptor under a 3-party LAN network over a public cloud, and achieve more than 370,000 DReLU/ReLU or 41,000 Maxpool (find the maximum value of nine inputs) operations per second. Under the same settings and environment, our ReLU protocol has a one or even two orders of magnitude improvement to the state-of-the-art works, Falcon (PETS 2021) or Edabits (CRYPTO 2020), respectively without batch processing. © 2022, CC BY-NC-ND.

关键词： batch data processing

Supervised tree-Wasserstein distance

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Takezawa, Yuki Sato, Ryoma Yamada, Makoto Kyoto University Japan RIKEN AIP Japan

To measure the similarity of documents, the Wasserstein distance is a powerful tool, but it requires a high computational cost. Recently, for fast computation of the Wasserstein distance, methods for approximating the Wasserstein distance using a tree metric have been proposed. These tree-based methods allow fast comparisons of a large number of documents;however, they are unsupervised and do not learn task-specific distances. In this work, we propose the Supervised Tree-Wasserstein (STW) distance, a fast, supervised metric learning method based on the tree metric. Specifically, we rewrite the Wasserstein distance on the tree metric by the parent-child relationships of a tree, and formulate it as a continuous optimization problem using a contrastive loss. Experimentally, we show that the STW distance can be computed fast, and improves the accuracy of document classification tasks. Furthermore, the STW distance is formulated by matrix multiplications, runs on a GPU, and is suitable for batch processing. Therefore, we show that the STW distance is extremely efficient when comparing a large number of documents. Copyright © 2021, The Authors. All rights reserved.

关键词： batch data processing

The case for alternative web archival formats to expedite The data-to-insight cycle

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Xinyue Xie, Zhiwu Virginia Polytechnic Institute State University BlacksburgVA United States

The WARC file format is widely used by web archives to preserve collected web content for future use. With the rapid growth of web archives and the increasing interest to reuse these archives as big data sources for statistical and analytical research, the speed to turn these data into insights becomes critical. In this paper we show that the WARC format carries significant performance penalties for batch processing workload. We trace the root cause of these penalties to its data structure, encoding, and addressing method. We then run controlled experiments to illustrate how severe these problems can be. Indeed, performance gain of one to two orders of magnitude can be achieved simply by reformatting WARC files into Parquet or Avro formats. While these results do not necessarily constitute an endorsement for Avro or Parquet, the time has come for the web archiving community to consider replacing WARC with more efficient web archival formats. Copyright © 2020, The Authors. All rights reserved.

关键词： batch data processing

QET: ENHANCING QUANTIZED LLM PARAMETERS AND KV CACHE COMPRESSION THROUGH ELEMENT SUBSTITUTION AND RESIDUAL CLUSTERING

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Yanshu Li, Wang Yao, Zhaoqian Yang, Tong Peking University Beijing China

The matrix quantization entails representing matrix elements in a more space-efficient form to reduce storage usage, with dequantization restoring the original matrix for use. We formulate the Quantization Error Minimization (QEM) problem as minimizing the distance between a matrix before and after quantization, under the condition that the quantized matrix occupies the same memory space. Matrix quantization is crucial in various applications, including Large Language Models (LLMs) weight quantization, vector databases, KV cache quantization, graph compression, and image compression. Recent advancements in LLMs, such as GPT-4 and BERT, have highlighted the importance of matrix compression due to the large size of parameters and KV cache, which are stored as matrices. We propose Quantum Entanglement Trees (QET) to address the QEM problem by leveraging the local orderliness of matrix elements, involving iterative element swapping to form a locally ordered matrix. This matrix is then grouped and quantized by columns. To enhance QET, we introduce two optimizations: further quantizing residuals to reduce MSE, and using masking and batch processing to accelerate the algorithm. Experimental results demonstrate that QET can effectively reduce MSE to 5.05%, 13.33%, and 11.89% of the current best method on the LLM dataset, K cache, and V cache, respectively. Our contributions include the abstraction of the QEM problem, the design of the QET algorithm, and the proposal of two optimizations to improve accuracy and speed. Copyright © 2024, The Authors. All rights reserved.

关键词： batch data processing

Orchestrating the Execution of Serverless Functions in Hybrid Clouds

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Peri, Aristotelis Tsenos, Michail Kalogeraki, Vana Athens University of Economics and Business Athens Greece

In recent years, serverless computing, especially Function as a Service (FaaS), is rapidly growing in popularity as a cloud programming model. The serverless computing model provides an intuitive interface for developing cloud-based applications, where the development and deployment of scalable microservices has become easier and cost-effective. An increasing number of batch-processing applications are deployed as pipelines that comprise a sequence of functions that must meet their deadline targets to be practical. In this paper, we present our Hybrid Cloud Scheduler (HCS) for orchestrating the execution of serverless batch-processing pipelines deployed over heterogeneous infrastructures. Our framework enables developers to (i) automatically schedule and execute batch-processing applications in heterogeneous environments such as the private edge and public cloud serverless infrastructures, (ii) benefit from cost reduction through the utilization of their own resources in a private cluster, and (iii) significantly improves the probability of meeting the deadline requirements of their applications. Our experimental evaluation demonstrates the efficiency and benefits of our approach. Copyright © 2024, The Authors. All rights reserved.

关键词： batch data processing