Preliminary Evaluation of SHAVER: Sharing Vector Registers with an Accelerator

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract In recent years, demand for data-parallel processing has been growing, and this parallelism often appears in AI processes. One method to accelerate these processes is using DSA, domain-specific architecture. A common data transfer method on DSA is DMA, which is direct memory access. There are several studies on DMA-based accelerators. However, few studies focus on data transfer methods. In this paper, a vector register-sharing mechanism has been proposed as a new data transfer method. Our proposed mechanism is named "SHAVER". In this mechanism, a part of vector registers is directly shared with an accelerator. An open-source RISC-V vector co-processor is used to evaluate the mechanism's potential. It has been implemented on an FPGA and a simulator for the evaluations. The results indicate the possibility of the proposal mechanism to achieve a maximum of 8.38% speedup over DMA transfer.
Full text 14,446 characters · extracted from preprint-html · click to expand
Preliminary Evaluation of SHAVER: Sharing Vector Registers with an Accelerator | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Preliminary Evaluation of SHAVER: Sharing Vector Registers with an Accelerator Tomoaki Tanaka, Michiya Kato, Yasunori Osana, Takefumi Miyoshi, and 3 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5328960/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 20 You are reading this latest preprint version Abstract In recent years, demand for data-parallel processing has been growing, and this parallelism often appears in AI processes. One method to accelerate these processes is using DSA, domain-specific architecture. A common data transfer method on DSA is DMA, which is direct memory access. There are several studies on DMA-based accelerators. However, few studies focus on data transfer methods. In this paper, a vector register-sharing mechanism has been proposed as a new data transfer method. Our proposed mechanism is named "SHAVER". In this mechanism, a part of vector registers is directly shared with an accelerator. An open-source RISC-V vector co-processor is used to evaluate the mechanism's potential. It has been implemented on an FPGA and a simulator for the evaluations. The results indicate the possibility of the proposal mechanism to achieve a maximum of 8.38% speedup over DMA transfer. RISC-V Hardware Acceleration FPGA SoC Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 14 Nov, 2024 Reviews received at journal 13 Nov, 2024 Reviews received at journal 13 Nov, 2024 Reviews received at journal 10 Nov, 2024 Reviews received at journal 04 Nov, 2024 Reviewers agreed at journal 02 Nov, 2024 Reviews received at journal 31 Oct, 2024 Reviewers agreed at journal 31 Oct, 2024 Reviewers agreed at journal 30 Oct, 2024 Reviewers agreed at journal 30 Oct, 2024 Reviewers agreed at journal 30 Oct, 2024 Reviewers agreed at journal 29 Oct, 2024 Reviewers agreed at journal 29 Oct, 2024 Reviewers agreed at journal 28 Oct, 2024 Reviewers agreed at journal 28 Oct, 2024 Reviewers agreed at journal 27 Oct, 2024 Reviewers invited by journal 27 Oct, 2024 Editor assigned by journal 26 Oct, 2024 Submission checks completed at journal 26 Oct, 2024 First submitted to journal 24 Oct, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5328960","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":373622121,"identity":"00b235d1-75cb-4361-88d4-572e5e0f5713","order_by":0,"name":"Tomoaki Tanaka","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABMklEQVRIie2RMUvEMBSAXylcloBrigf+hR6Foniav9JSqEt1uVXUyQxGXfVfWA6cK4VOreJ2cg7pclOH3nJUEDFVC3LtwY0i+SDkJXlf8pIAKBR/loh8ddoZDJeXcCsZNwr+VvyfGadZWqlAo8TLShuKLlxRpdsyyB7mN8dPlAJ6FloVb1HQ8xL6r61TcDYe8IksDB95xl0ydTngkQlOPODQs+T8rKWQw3uCS3LKITAN0Zs6GLBPpKJxAFsmxF2K8V7K3TYK6018PNJGoRzQYpWyievCSGAb4XkkN0dJrdQVdp+SZmOrn0plUtg7t1eey2Osm45/4MlgRJz2XRC7DPMiOQF0HVgvfLFPEWO5KIe7e4yxsJzz1ot1oGOz/hYZyObyaA0FkPg1qNZSFAqF4l/zCdQ9Z957JeVNAAAAAElFTkSuQmCC","orcid":"","institution":"Tokyo University of Agriculture and Technology","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Tomoaki","middleName":"","lastName":"Tanaka","suffix":""},{"id":373622123,"identity":"7104bef9-684b-4d7e-85ed-1a1d69a81a35","order_by":1,"name":"Michiya Kato","email":"","orcid":"","institution":"Tokyo University of Agriculture and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Michiya","middleName":"","lastName":"Kato","suffix":""},{"id":373622124,"identity":"f341f22e-6b29-4143-8939-c4324a0d86aa","order_by":2,"name":"Yasunori Osana","email":"","orcid":"","institution":"Kumamoto University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Yasunori","middleName":"","lastName":"Osana","suffix":""},{"id":373622125,"identity":"b1ed6163-5b18-4e5b-a9b7-90304fb27c1a","order_by":3,"name":"Takefumi Miyoshi","email":"","orcid":"","institution":"WasaLabo, LLC.","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Takefumi","middleName":"","lastName":"Miyoshi","suffix":""},{"id":373622126,"identity":"576bf3c7-085f-49b9-9187-c74a7032bf76","order_by":4,"name":"Jubee Tada","email":"","orcid":"","institution":"Yamagata University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Jubee","middleName":"","lastName":"Tada","suffix":""},{"id":373622127,"identity":"a227e36a-1371-437e-9c3b-e414e9feeb3b","order_by":5,"name":"Kiyofumi Tanaka","email":"","orcid":"","institution":"Japan Advanced Institute of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Kiyofumi","middleName":"","lastName":"Tanaka","suffix":""},{"id":373622128,"identity":"d8294ac6-f43c-4aa2-b0df-5ed6b438c6a5","order_by":6,"name":"Hironori Nakajo","email":"","orcid":"","institution":"Tokyo University of Agriculture and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Hironori","middleName":"","lastName":"Nakajo","suffix":""}],"badges":[],"createdAt":"2024-10-25 02:38:11","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5328960/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5328960/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":68335522,"identity":"d7b91421-ac24-40a8-bbb8-0df7b9c13e32","added_by":"auto","created_at":"2024-11-06 08:07:15","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1550058,"visible":true,"origin":"","legend":"","description":"","filename":"R10JoS.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5328960/v1_covered_b1e39ab7-f6f2-4e43-a5f4-01e4bf007132.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Preliminary Evaluation of SHAVER: Sharing Vector Registers with an Accelerator","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"RISC-V, Hardware Acceleration, FPGA, SoC","lastPublishedDoi":"10.21203/rs.3.rs-5328960/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5328960/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn recent years, demand for data-parallel processing has been growing, and this parallelism often appears in AI processes. One method to accelerate these processes is using DSA, domain-specific architecture. A common data transfer method on DSA is DMA, which is direct memory access. There are several studies on DMA-based accelerators. However, few studies focus on data transfer methods. In this paper, a vector register-sharing mechanism has been proposed as a new data transfer method. Our proposed mechanism is named \"SHAVER\". In this mechanism, a part of vector registers is directly shared with an accelerator. An open-source RISC-V vector co-processor is used to evaluate the mechanism's potential. It has been implemented on an FPGA and a simulator for the evaluations. The results indicate the possibility of the proposal mechanism to achieve a maximum of 8.38% speedup over DMA transfer.\u003c/p\u003e","manuscriptTitle":"Preliminary Evaluation of SHAVER: Sharing Vector Registers with an Accelerator","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-11-06 07:59:07","doi":"10.21203/rs.3.rs-5328960/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-11-14T17:52:13+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-11-14T03:03:20+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-11-13T15:17:25+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-11-11T04:18:04+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-11-04T05:24:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"126960666916442076331836454811672900263","date":"2024-11-02T13:08:36+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-10-31T06:59:59+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"198327149225514053419709848858868913380","date":"2024-10-31T05:29:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"61749496498641986177456905732164891070","date":"2024-10-30T13:08:04+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"324135996221979817141957271058194210176","date":"2024-10-30T12:48:45+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"325282038438851204549421707089621266750","date":"2024-10-30T06:27:34+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"90350777855476038521352395333893818224","date":"2024-10-30T01:54:57+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"26031071270593614078775183479658614090","date":"2024-10-30T00:45:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"211503147299708837152192980279729311615","date":"2024-10-28T04:21:23+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"42855928787553006009903249129434150399","date":"2024-10-28T04:05:00+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"8298212464670609632283948013752152264","date":"2024-10-28T03:58:29+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-10-28T00:30:10+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-10-26T07:12:08+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-10-26T07:11:09+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2024-10-25T02:29:39+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0304ecbb-68aa-40dd-acf8-95aaf5d8f13b","owner":[],"postedDate":"November 6th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-12-19T00:38:10+00:00","versionOfRecord":[],"versionCreatedAt":"2024-11-06 07:59:07","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5328960","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5328960","identity":"rs-5328960","version":["v1"]},"buildId":"7rjqhiLT3MXkJMwkYKINL","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00