Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Vadakkedathu T. Rajan"'
Publikováno v:
ACM SIGPLAN Notices. 48:58-71
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f869bf50210968ad7a8572d5c169f3e
https://doi.org/10.1145/2502508.2502523
https://doi.org/10.1145/2502508.2502523
Autor:
Daniel Iercan, Christoph M. Kirsch, Rainer Trummer, Joshua S. Auerbach, Vadakkedathu T. Rajan, Harald Röck, David F. Bacon
Publikováno v:
ACM Transactions on Embedded Computing Systems. 8:1-48
Exotasks are a novel Java programming construct that achieve three important goals. They achieve low latency while allowing the fullest use of Java language features, compared to previous attempts to restrict the Java language for use in the submilli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8581fa9ee84c62f2dae8f0e33768cd2e
https://doi.org/10.1145/1457255.1457262
https://doi.org/10.1145/1457255.1457262
Autor:
Alexander Tarvo, Matthew Arnold, Nick Mitchell, Vadakkedathu T. Rajan, Ioana Baldini, Peter F. Sweeney
Publikováno v:
ISSTA
Canary testing is an emerging technique that offers to minimize the risk of deploying a new version of software. It does so by slowly transferring load from the current to the new ("canary") version. As this ramp-up progresses, a human compares the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff951d471e8ff9acd5d387a9e2e56b1d
https://doi.org/10.1145/2771783.2784770
https://doi.org/10.1145/2771783.2784770
Publikováno v:
LCTES
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a5196e55381a436af814b69db269442
https://doi.org/10.1145/780731.780744
https://doi.org/10.1145/780731.780744
Publikováno v:
POPL
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7be5d558e3d715d1f1d3243856748711
https://doi.org/10.1145/640128.604155
https://doi.org/10.1145/640128.604155
Publikováno v:
Rapid Prototyping Journal. 7:231-241
Many engineering and scientific problems require the filling of a two‐dimensional region with scan lines of finite width. The number of contiguous scan line segments required for the filling depends on the direction used for scanning. When the cost
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d32355f08d1440afe0675d0bfce90e13
https://doi.org/10.1108/13552540110410431
https://doi.org/10.1108/13552540110410431
Autor:
Vadakkedathu T. Rajan, Niranjan Mayya
Publikováno v:
Journal of Mathematical Imaging and Vision. 6:355-378
This paper describes an efficient shape representation framework for planar shapes using Voronoi skeletons. This paper makes the following significant contributions. First a new algorithm for the construction of the Voronoi diagram of a polygon with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9744d75850345fae143f65ebd8050313
https://doi.org/10.1007/bf00123352
https://doi.org/10.1007/bf00123352
Autor:
Niranjan Mayya, Vadakkedathu T. Rajan
Publikováno v:
Pattern Recognition Letters. 16:147-160
This paper describes an efficient shape representation scheme using Voronoi skeletons. This paper makes the following significant contributions. First a new algorithm for the construction of the Voronoi diagram of a polygon with holes is described. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff461dd527cc5b54e39feb1fc5086c4c
https://doi.org/10.1016/0167-8655(94)00087-j
https://doi.org/10.1016/0167-8655(94)00087-j
Publikováno v:
ACM SIGMETRICS Performance Evaluation Review. 28:27-29
The problem of optimally allocating the components of a distributed program over several machines can be shown to reduce to a multi-terminal graph cutting problem. In case of three of more terminals, this problem has been shown to be NP-hard. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fca4be1dd533517dee6710a08b6e6e2
https://doi.org/10.1145/544397.544408
https://doi.org/10.1145/544397.544408
Autor:
Rainer Trummer, Joshua S. Auerbach, Vadakkedathu T. Rajan, Daniel Iercan, David F. Bacon, Christoph M. Kirsch, Harald Roeck
Publikováno v:
LCTES
Existing programming methodologies for real-time systems suffer from a low level of abstraction and non-determinism in both the timing and the functional domains. As a result, real-time systems are difficult to test and must be re-certified every tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1489a0847681ebec45a7a1a73345f543
https://doi.org/10.1145/1254766.1254775
https://doi.org/10.1145/1254766.1254775