Zobrazeno 1 - 10
of 193
pro vyhledávání: '"Grzegorz Malewicz"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 18:1607-1617
Earlier work has developed the underpinnings of the IC-scheduling theory, a framework for scheduling computations having intertask dependencies - modeled via directed acyclic graphs (DAGs) - for Internet-based computing. The goal of the schedules pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7014f14f69b73834ea739d7312664d3f
https://doi.org/10.1109/tpds.2007.1067
https://doi.org/10.1109/tpds.2007.1067
Autor:
Li Gao, Grzegorz Malewicz
Publikováno v:
Theory of Computing Systems. 41:731-752
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server that coordinates the computation of a massive number of unreliable worke
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e47f171ff09cda636fbf5be14e8fd898
https://doi.org/10.1007/s00224-006-1296-9
https://doi.org/10.1007/s00224-006-1296-9
Publikováno v:
Journal of Grid Computing. 5:197-212
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the Grid. One way to mitigate the unpredictability is to schedule job execution in a manner that constantly maximizes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e18ac866f9926fab6a47d25c5cff8703
https://doi.org/10.1007/s10723-007-9065-9
https://doi.org/10.1007/s10723-007-9065-9
Publikováno v:
IEEE Transactions on Computers. 55:757-768
Conceptual and algorithmic tools are developed as a foundation for a theory of scheduling complex computation-dags for Internet-based computing. The goal of the schedules produced is to render tasks eligible for allocation to remote clients (hence, f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce31f2533ed881a5c4ad5b21b1ec4bb7
https://doi.org/10.1109/tc.2006.91
https://doi.org/10.1109/tc.2006.91
Publikováno v:
Distributed Computing. 18:409-420
The dissertation studies how distributed devices that are disconnected for long and unknown periods can efficiently perform a set of tasks. Given n distributed devices that must perform t independent tasks, known to each device, the goal is to schedu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15df88f461e47a74ff0b74d5ede7346c
https://doi.org/10.1007/s00446-005-0149-0
https://doi.org/10.1007/s00446-005-0149-0
Autor:
Grzegorz Malewicz
Publikováno v:
SIAM Journal on Computing. 34:993-1024
Martel [C. Martel, A. Park, and R. Subramonian, SIAM J. Comput., 21 (1992), pp. 1070--1099] posed a question for developing a work-optimal deterministic asynchronous algorithm for the fundamental load-balancing and synchronization problem called Cert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d75bcf4d03c970ede4b79e49afc8318
https://doi.org/10.1137/s0097539703428014
https://doi.org/10.1137/s0097539703428014
Autor:
Aart J. C. Bik, Ilan Horn, Matthew H. Austern, Naty Leiser, Grzegorz Czajkowski, James C. Dehnert, Grzegorz Malewicz
Publikováno v:
SIGMOD Conference
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs - in some cases billions of vertices, trillions of edges - poses challenges to their efficient proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04e547ba84ecbd4ca583373cbe66a125
https://doi.org/10.1145/1807167.1807184
https://doi.org/10.1145/1807167.1807184
Autor:
Ilan Horn, Naty Leiser, Aart J. C. Bik, James C. Dehnert, Grzegorz Malewicz, Grzegorz Czajkowski, Matthew H. Austern
Publikováno v:
SPAA
PODC
PODC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f45fc731f60213a048f47ebce4783414
https://doi.org/10.1145/1583991.1584010
https://doi.org/10.1145/1583991.1584010
Publikováno v:
PDP
A key challenge when scheduling computations over the Internet is temporal unpredictability: remote ''workers'' arrive and depart at unpredictable times and often provide unpredictable computational resources; the time for communication over the Inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9bfaf0235821e160bf9e5d7354f6139
http://hdl.handle.net/11386/1856509
http://hdl.handle.net/11386/1856509
Publikováno v:
IPDPS
Earlier work has developed the underpinnings of IC-scheduling theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computing (IC). The theory aims to produce schedules that render tasks eligibl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d33fc04bf055144da27ad37d8ce317c
http://hdl.handle.net/11386/1663827
http://hdl.handle.net/11386/1663827