Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Michael A. Palis"'
Publikováno v:
Neurocomputing. 74:3793-3799
A computational model, the bounded composite inverse-d architecture (BCIA), was developed to characterize signaling in small-world networks with large but bounded numbers of nodes, as in human brains. The model is based upon an N-dimensional symmetri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b54d33e9676d7397b99bd67709bdeb5
https://doi.org/10.1016/j.neucom.2011.07.022
https://doi.org/10.1016/j.neucom.2011.07.022
Autor:
Michael A. Palis
Publikováno v:
IEEE Transactions on Computers. 54:1572-1583
This paper investigates the task scheduling problem for real-time systems that provide rate of progress guarantees on task execution. A parameterized task system model, called the (r, g) task system, is introduced that allows rate of progress require
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4029fe0bc5d563040bd9763c4cbe45be
https://doi.org/10.1109/tc.2005.204
https://doi.org/10.1109/tc.2005.204
Autor:
Michael A. Palis
Publikováno v:
International Journal of Foundations of Computer Science. 14:359-370
This paper investigates the task scheduling problem in the oontext of reservation-based real-time systems that provide quality of service (QoS) guarantees. In such a system, each incoming task specifies a rate of progress requirement on the task's ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef206e045abd0b704bd0bb0d51f5d770
https://doi.org/10.1142/s0129054103001789
https://doi.org/10.1142/s0129054103001789
Autor:
Bhaskar Das Gupta, Michael A. Palis
Publikováno v:
Journal of Scheduling. 4:297-312
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ac83faba94160d6bed4f8932ad8de61
https://doi.org/10.1002/jos.85
https://doi.org/10.1002/jos.85
Autor:
Michael A. Palis, Bhaskar DasGupta
Publikováno v:
Journal of Parallel and Distributed Computing. 57:345-357
This paper addresses the problem of scheduling packet transmissions in wavelength-division multiplexed networks with tunable transmitters and fixed-tuned receivers. Unlike previous work which assume that all packets are known in advance, this paper c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bc3d43a93abf53f5ce75e7d6142c927
https://doi.org/10.1006/jpdc.1999.1542
https://doi.org/10.1006/jpdc.1999.1542
Publikováno v:
Parallel Algorithms and Applications. 12:185-203
CASS is a task management system that provides facilities for automatic grain-size optimization and task scheduling of parallel programs on distributed memory parallel architectures. The heart of CASS is a clustering module that partitions the tasks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48b470c799dd17b4a81856756165b7d9
https://doi.org/10.1080/01495739708941421
https://doi.org/10.1080/01495739708941421
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 7:46-55
This paper addresses the problem of scheduling parallel programs represented as directed acyclic task graphs for execution on distributed memory parallel architectures. Because of the high communication overhead in existing parallel machines, a cruci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71fea734f203478324372dfc8dd4d946
https://doi.org/10.1109/71.481597
https://doi.org/10.1109/71.481597
Autor:
Michael A. Palis, Sunil M. Shende
Publikováno v:
Mathematical Systems Theory. 28:199-213
We investigate a progression of grammatically defined language families, thecontrol language hierarchy. This hierarchy has been studied recently from the perspective of providing a linguistic framework for natural language syntax. We exhibit a progre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84ccf8bb4e2cc1d8bd239614e7951832
https://doi.org/10.1007/bf01303055
https://doi.org/10.1007/bf01303055
Publikováno v:
Journal of Parallel and Distributed Computing. 20:145-157
We consider the problem of permutation routing on a star graph, an interconnection network which has better properties than the hypercube. In particular, its degree and diameter are sublogarithmic in the network size. We present optimal randomized ro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bfaf6fa3d138bf5f773e47b50a91858
https://doi.org/10.1006/jpdc.1994.1015
https://doi.org/10.1006/jpdc.1994.1015
Autor:
Michael A. Palis
Publikováno v:
International Journal of Foundations of Computer Science. 12:245-247
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a026aff740021c6585353606bb0e4eab
https://doi.org/10.1142/s0129054101000461
https://doi.org/10.1142/s0129054101000461