Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Kefu Lu"'
Publikováno v:
Euro-Par 2021: Parallel Processing ISBN: 9783030856649
Euro-Par
Euro-Par
This work introduces novel parallel methods for weighted longest common subsequence (WLCS) and its generalization, all-substrings WLCS. Previous work developed efficient algorithms for these problems via Monge matrix multiplication, which is a limiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e1bc2c4f395b26a943d6078f25a91ea
https://doi.org/10.1007/978-3-030-85665-6_23
https://doi.org/10.1007/978-3-030-85665-6_23
Publikováno v:
Machine Learning and Knowledge Discovery in Databases ISBN: 9783030461492
ECML/PKDD (1)
ECML/PKDD (1)
Hierarchical clustering is a fundamental tool in data mining, machine learning and statistics. Popular hierarchical clustering algorithms include top-down divisive approaches such as bisecting k-means, k-median, and k-center and bottom-up agglomerati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c11ef764bcfd489913a2a08141b2b45d
https://doi.org/10.1007/978-3-030-46150-8_5
https://doi.org/10.1007/978-3-030-46150-8_5
Publikováno v:
IPDPS
Many algorithms have been proposed to efficiently schedule parallel jobs on a multicore and/or multiprocessor machine to minimize average flow time, and the complexity of the problem is well understood. In practice, the problem is far from being unde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fd0ff76a71754c839251d62c9cb3b86
https://doi.org/10.1109/ipdps.2019.00024
https://doi.org/10.1109/ipdps.2019.00024
Publikováno v:
LATIN 2018: Theoretical Informatics ISBN: 9783319774039
LATIN
LATIN
In this paper, we consider scheduling parallelizable jobs online to maximize the throughput or profit of the schedule. In particular, a set of n jobs arrive online and each job \(J_i\) arriving at time \(r_i\) has an associated function \(p_i(t)\) wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8268729882a4b60fbd81acf4af14fa5e
https://doi.org/10.1007/978-3-319-77404-6_55
https://doi.org/10.1007/978-3-319-77404-6_55
Publikováno v:
SPAA
We consider scheduling parallelizable jobs online to maximize the throughput or profit of the schedule. A set of n jobs arrive online and each job Ji has an associated function pi(t), the profit obtained for finishing job Ji at time t. Each job has i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e752983bdf18fa9c6290c59407bee21c
https://doi.org/10.1145/3087556.3087590
https://doi.org/10.1145/3087556.3087590
Publikováno v:
SPAA
In this paper we study the problem of scheduling a set of dynamic multithreaded jobs with the objective of minimizing the maximum latency experienced by any job. We assume that jobs arrive online and the scheduler has no information about the arrival
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc6ecec9a1fa61c77e4763ff479fcb06
https://doi.org/10.1145/2935764.2935782
https://doi.org/10.1145/2935764.2935782
Publikováno v:
IPDPS
In this paper we consider feasibility tests for partitioned scheduling sporadic tasks on a set of heterogeneous machines with different speeds. Previously a 3-approximate feasibility test was known. The feasibility test is a natural, fast and efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7897818a0bb5e99e8784a5a68b8049b
https://doi.org/10.1109/ipdps.2016.47
https://doi.org/10.1109/ipdps.2016.47
Publikováno v:
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d55d3965ec5eb5060faaef6b194cd774
https://doi.org/10.1137/1.9781611974331.ch14
https://doi.org/10.1137/1.9781611974331.ch14
Publikováno v:
SPAA
Although concurrent data structures are commonly used in practice on shared-memory machines, even the most efficient concurrent structures often lack performance theorems guaranteeing linear speedup for the enclosing parallel program. Moreover, effic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75d4f9323dd28dcdf33f9bc18cbc6f51
https://doi.org/10.1145/2612669.2612688
https://doi.org/10.1145/2612669.2612688