The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 234 of Computational Linguistics Vol. 21, Issue 2
[page]
1995
Computational Linguistics
Preserved Fulltext
The corresponding DAG takes 360Kb of space and provides an access time of 12,000 words per second.‘
4 The size of the dictionary in plain text (ASCII form) is 742KB.
234 ...
To achieve high speed for this procedure, the dictionary is represented by a deter- ministic finite-state automaton with both fast access and small storage space. ...
DAG-based Scheduling with Resource Sharing for Multi-task Applications in a Polyglot GPU Runtime
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work, we present a novel GPU run time scheduler for multi-task GPU computations that transparently provides asynchronous execution, space-sharing, and transfer-computation overlap without requiring ...
We validate our work on 6 benchmarks created to evaluate task-parallelism and show an average of 44% speedup against synchronous execution, with no execution time slowdown compared to hand-optimized host ...
We also thank Rene Mueller and Lukas Stadler, the original authors of GrCUDA, for their valuable feedback and opinions. Oracle and Java are registered trademarks of Oracle and/or its affiliates. ...
arXiv:2012.09646v2
fatcat:tzaiunieyfepxiar4na5aqc6gm
Author retrospective for PYRROS
2014
25th Anniversary International Conference on Supercomputing Anniversary Volume -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Since the publication of the PYRROS project, there have been new advancements in the area of DAG scheduling algorithms, the use of DAG scheduling for irregular and large-scale computation, and software ...
Given a program with annotated task parallelism represented as a directed acyclic graph (DAG), the PYRROS project was focused on fast DAG scheduling, code generation and runtime execution on distributed ...
Any opinions, findings, conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF.
REFERENCES ...
doi:10.1145/2591635.2591647
dblp:conf/ics/YangG14
fatcat:35dgziip7rbrnacduqv2z7z3ji
An Infinite Pebble Game and Applications
1997
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
The pebble complexity o f t is given by: pebble(t) = min f n j dag(t) is accessible to the n-pebble game g : The pebble complexity of a guarded command ' ! t is: pebble(' ! ...
The bounded-space version of this class, BOUNDED-EEDS, imposes a bound on the quanti er-depth of formulas, in addition to bounding the pebble complexity of terms. ...
doi:10.1006/inco.1997.2640
fatcat:dp3vkv77z5hg3f56c7k2c77gay
Parallel test generation and execution with Korat
2007
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The algorithms build on the Korat algorithm for constraint-based generation of structurally complex test inputs. ...
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. ...
Acknowledgments We thank Jeff Erickson for his comments on the algorithm for equidistancing; Dragan Milićev for discussions on the initial design of the current Korat implementation; and Brett Daniel, ...
doi:10.1145/1287624.1287645
dblp:conf/sigsoft/MisailovicMPKM07
fatcat:a7niiaemwvelpjrnuiw7ewdk7e
LRC: Dependency-Aware Cache Management for Data Analytics Clusters
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Without this knowledge, memory caching can at best be performed by "guessing" the future data access patterns based on historical information (e.g., the access recency and/or frequency), which frequently ...
LRC evicts the cached data blocks whose reference count is the smallest. The reference count is defined, for each data block, as the number of dependent child blocks that have not been computed yet. ...
ACKNOWLEDGEMENTS We thank Chengliang Zhang for helping on the implementation of LRC-Online and the deployment of multi-tenant experiments. ...
arXiv:1703.08280v1
fatcat:f34lq55hhvfldmmu65ez45qo6y
G-AQFS: grid computing exploitation for the management of air quality in presence of complex meteorological circulations
2004
International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Modeling system consists of meteorological and dispersion models coupled in cascade. The computational workflow of the Modeling system is defined by means of DAGs (Direct Acyclic Graph). ...
Leveraging Grid Computing technology, i.e. the virtualization of distributed computing and data resources such as processing, network bandwidth and storage capacity to create a single system image, we ...
Dario Conte and Mr. Cosimo Elefante for their computational support, to Mr. Giovanni Lella and Mr. Gennaro Rispoli for their technical support. ...
doi:10.1109/itcc.2004.1286594
dblp:conf/itcc/AloisioCCMMMMRST04
fatcat:n4ug5nwyfncyjblrkq7iamxtdu
Sustained Space Complexity
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Alwen and Serbinenko [STOC'15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. ...
Our main technical contribution is the construction is a family of DAGs on n nodes with constant indegree with high "sustained-space complexity", meaning that any parallel black-pebbling strategy requires ...
Acknowledgments The first and third authors were supported by the European Research Council, ERC consolidator grant (682815 -TOCNeT). ...
arXiv:1705.05313v2
fatcat:vopwyysqjzgdtfttthqmsp4yku
Spatial complexity of reversibly computable DAG
2009
Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
and backward execution of a DAG . ...
Spatial complexity is the amount of memory/register locations required for performing the computation in both forward and backward directions. ...
Unfortunately some of them could not be taken into consideration due to the shortage of time. ...
doi:10.1145/1629395.1629404
dblp:conf/cases/BahiE09
fatcat:qkttoxl5ejhylinx6xbzbq3xsu
Efficient Algorithm for Multi Query Optimization
2015
International Journal of Database Theory and Application
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The multiple queries from different users that have been addressed to one schema often have a lot of common sub-expressions and it is the function of the multi query optimization algorithms such as Basic ...
The Algorithm has a time complexity of O(n 2 + 9n +6) while the most recent basic algorithm thus Volcano RU Algorithm has O(2n 2 +20n +12), both the algorithms have O(n 2 ) time complexity which is quadratic ...
Identifying the common expressions so that the database accesses and computational costs are minimized; ii. ...
doi:10.14257/ijdta.2015.8.6.12
fatcat:a3k4qushpbdsvdznswppsize5a
Affinity Driven Distributed Scheduling Algorithm for Parallel Computations
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Distributed scheduling of parallel computations on multiple places 1 needs to follow affinity and deliver efficient space, time and message complexity. ...
Theoretical analysis of the expected and probabilistic lower and upper bounds on time and message complexity of this algorithm has been provided. ...
Within a place, the online unfolding of the computation DAG happens in a depth-first manner to enable efficient space and time execution. ...
doi:10.1007/978-3-642-17679-1_15
fatcat:efkep4jzpva2pjf4aest3gauae
StencilFlow: Mapping Large Stencil Programs to Distributed Spatial Computing Systems
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Spatial computing devices have been shown to significantly accelerate stencil computations, but have so far relied on unrolling the iterative dimension of a single stencil operation to increase temporal ...
This work considers the general case of mapping directed acyclic graphs of heterogeneous stencil computations to spatial computing systems, assuming large input programs without an iterative component. ...
ACKNOWLEDGEMENTS We authors wish to thank Tobias Kenter, Christian Plessl, and the Paderborn Center for Parallel Computing (PC 2 ) for generously providing support and compute hours on the Noctua FPGA ...
arXiv:2010.15218v2
fatcat:kev77kpks5abhjjgosqidjfdki
Space and time efficient execution of parallel irregular computations
1997
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This work is implemented in the context of RAPID system [5] which provides run-time support for parallelizing irregular code on distributed memory machines and the effectiveness of the proposed techniques ...
The irregular parallelism is modeled by task dependence graphs with mixed granularities. The trade-off in achieving both time and space efficiency is investigated. ...
on a given DAG with a complexity proportional to the size of the graph. ...
doi:10.1145/263767.263773
fatcat:fe7tm53q6re6tn4vg54u4f7llm
One Edge at A Time: A Novel Approach towards Efficient Transitive Reduction Computation on DAGs
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Citation information: DOI 10.1109/ACCESS.2020.2975650, IEEE Access FIGURE 1 : 1 DAG G and its TR G tr , where the integer on the right of each node v is v's topo-order. ...
Algorithm
Time complexity
Space complexity
Category
TABLE 3 : 3 The comparison of time and space complexities. algorithm
time complexity space complexity
TABLE 4 : 4 Statistics of datasets ...
She is currently a faculty member with Computer Department with School of Electronic and Electrical Engineering of Shanghai University of Science Engineering, Shanghai, China. ...
doi:10.1109/access.2020.2975650
fatcat:sn65eutfdbe5pjaqi6x67mddmu
DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For example, dynamic race detection relies on efficient "on-the-fly" determination of dependencies between sequential and parallel tasks (e.g. to quickly determine whether or not two memory accesses occur ...
Our algorithm – called DePa – represents a computation as a graph and encodes vertices in the graph with two components: a dag-depth and a fork-path. ...
The dag-depth component requires one word, and the fork-path is a bit sequence of length 𝑓 . Together, these require 1 + ⌈𝑓 /𝜔⌉ words. □ Theorem 3.5 (DePa Space). ...
arXiv:2204.14168v1
fatcat:emfhfoaatnh7deu62prcpb7zr4
« Previous
Showing results 1 — 15 out of 15,441 results