|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1968 occurrences of 928 keywords
|
|
|
Results
Found 1841 publication records. Showing 1841 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
69 | Pao-Ann Hsiung, Cheng-Yi Lin, Trong-Yen Lee |
Quasi-Dynamic Scheduling for the Synthesis of Real-Time Embedded Software with Local and Global Deadlines. |
RTCSA |
2003 |
DBLP DOI BibTeX RDF |
Periodic Time Petri Nets, quasi-dynamic scheduling, local and global deadlines, software synthesis, Real-time embedded software |
65 | Fang Feng, Sanjay Kamat, Wei Zhao 0001 |
Guaranteeing application-to-application deadlines in distributed real-time systems. |
LCN |
1995 |
DBLP DOI BibTeX RDF |
application-to-application deadlines, message deadlines, independent method, conservative estimates, host utilization, performance evaluation, real-time systems, distributed real-time systems, message delays |
63 | Areej Zuhily, Alan Burns 0001 |
Exact scheduling analysis of non-accumulatively monotonic multiframe tasks. |
Real Time Syst. |
2009 |
DBLP DOI BibTeX RDF |
Multiframe, Frame specific deadlines, Scheduling, Arbitrary deadlines |
58 | David W. Craig, C. Murray Woodside |
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
rejection rate for tasks, random arrivals, random-arrivals-with-deadlines, rejection probabilities, scheduling, performance evaluation, real-time systems, queueing theory, deadlines, preemptive scheduling, RAD |
55 | Marco Caccamo, Giuseppe Lipari, Giorgio C. Buttazzo |
Sharing Resources among Periodic and Aperiodic Tasks with Dynamic Deadlines. |
RTSS |
1999 |
DBLP DOI BibTeX RDF |
hybrid task sets, dynamic deadlines, Real-time scheduling, resource constraints |
52 | Hui Wu 0001, Joxan Jaffar, Jingling Xue |
Instruction Scheduling with Release Times and Deadlines on ILP Processors. |
RTCSA |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Chi-Sheng Shih 0001, Lui Sha, Jane W.-S. Liu |
Scheduling Tasks With Variable Deadlines. |
IEEE Real Time Technology and Applications Symposium |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Haifeng Zhu 0001, Jeffery P. Hansen, John P. Lehoczky, Ragunathan Rajkumar |
Optimal Partitioning for Quantized EDF Scheduling. |
RTSS |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Krithi Ramamritham, John A. Stankovic, Perng-Fei Shiah |
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems. |
IEEE Trans. Parallel Distributed Syst. |
1990 |
DBLP DOI BibTeX RDF |
real-time multiprocessor systems, worst-case computation times, partial schedule, scheduling, real-time systems, multiprocessing systems, scheduling algorithms, dynamic scheduling, deadlines, deadlines, resources requirements, feasible schedule, heuristic functions |
45 | Yossi Azar, Nir Levy |
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Andreas Willig |
Scheduling multiple streams with (m, k)-firm deadlines having different importance over Markovian channels. |
ETFA |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Joseph Sifakis |
A General Framework for the Composition of Timed Systems Extended Abstract. |
FTRTFT |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Jiang Zhu, Ted G. Lewis, Weldon Jackson, Russel L. Wilson |
Scheduling in Hard Real-Time Applications. |
IEEE Softw. |
1995 |
DBLP DOI BibTeX RDF |
|
40 | Rodolfo Gómez 0001 |
A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata. |
FORMATS |
2009 |
DBLP DOI BibTeX RDF |
Urgent actions, Timed Automata with Deadlines, Uppaal |
40 | Jinsung Cho, Heonshik Shin |
Heuristic scheduling for multimedia streams with firm deadlines. |
RTCSA |
1997 |
DBLP DOI BibTeX RDF |
heuristic scheduling, firm deadlines, real-time manipulation, admission control criteria, multimedia task sets, simulation, multimedia streams, heuristic programming, graceful degradation, QoS parameters, scheduling scheme, heuristic functions, heuristic function |
40 | Guillem Bernat, Alan Burns 0001 |
Combining (mn)-hard deadlines and dual priority scheduling. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
(/sub m//sup n/)-hard deadlines, dual priority scheduling, soft tasks, dual priority mechanism, dynamic priority, real-time system, processor scheduling, temporal constraint, fixed priority scheduling, average response time |
40 | Wei-Kuan Shih, Jane W.-S. Liu, C. L. Liu 0001 |
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines. |
IEEE Trans. Software Eng. |
1993 |
DBLP DOI BibTeX RDF |
modified rate-monotonic algorithm, periodic jobs, deferred deadlines, semi-static priority-driven algorithm, time instant, old requests, current request, independent jobs, request deadline, deterministic scheduling theory, scheduling, real-time systems, real-time systems, computational complexity, embedded systems, operating system, scheduling algorithms, job scheduling, operating systems (computers), multiprogramming, feasibly scheduled |
39 | Luís Fernando Orleans, Carlo Emmanoel Tolla de Oliveira, Pedro Furtado 0001 |
Task Assignment on Parallel QoS Systems. |
WISE |
2007 |
DBLP DOI BibTeX RDF |
QoS, load-balancing, parallel systems, deadlines |
39 | Seong Woo Kwak, Byung-Jae Choi, Byung Kook Kim |
Checkpointing strategy for multiple real-time tasks. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
multiple real time tasks, checkpointing strategy, task deadlines, checkpoint placement, approximated failure probability, real-time systems, probability, system recovery, error bound |
37 | Enrico Bini, Giorgio C. Buttazzo |
The space of EDF deadlines: the exact region and a convex approximation. |
Real Time Syst. |
2009 |
DBLP DOI BibTeX RDF |
Deadline assignment, Performance optimization, Earliest deadline first |
37 | Enrico Bini, Giorgio C. Buttazzo |
The Space of EDF Feasible Deadlines. |
ECRTS |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Mercedes G. Merayo, Manuel Núñez 0001, Ismael Rodríguez |
Formal Testing of Systems Presenting Soft and Hard Deadlines. |
FSEN |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Nathan Fisher, Sanjoy K. Baruah |
The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms. |
OPODIS |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Pedro R. D'Argenio, Biniam Gebremichael |
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Srikanth Ramamurthy |
Scheduling Periodic Hard Real-Time Tasks with Arbitrary Deadlines on Multiprocessors. |
RTSS |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To |
On-Line Scheduling with Tight Deadlines. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
37 | Frank Dignum, Ruurd Kuiper 0001 |
Obligations and Dense Time for Specifying Deadlines. |
HICSS (5) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Jacques Verriet |
Scheduling Interval Ordered Tasks with Non-Uniform Deadlines. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Edgard de Faria Corrêa, Leonardo Alves de Paula e Silva, Flávio Rech Wagner, Luigi Carro |
Fitting the router characteristics in NoCs to meet QoS requirements. |
SBCCI |
2007 |
DBLP DOI BibTeX RDF |
QoS, embedded systems, real time, systems-on-chip, networks-on-chip |
36 | Richard West, Yuting Zhang, Karsten Schwan, Christian Poellabauer |
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Chi-Sheng Shih 0001, Jane W.-S. Liu |
State-Dependent Deadline Scheduling. |
RTSS |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Guillem Bernat, Alan Burns 0001, Albert Llamosí |
Weakly Hard Real-Time Systems. |
IEEE Trans. Computers |
2001 |
DBLP DOI BibTeX RDF |
Real-time systems, specification, scheduling algorithms, schedulability analysis, temporal constraints, transient overload |
33 | Moncef Hamdaoui, Parameswaran Ramanathan |
A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines. |
IEEE Trans. Computers |
1995 |
DBLP DOI BibTeX RDF |
deadline-constrained scheduling, soft deadlines, Real-time systems, priority queues, dynamic failure |
33 | Jia Xu |
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations. |
IEEE Trans. Software Eng. |
1993 |
DBLP DOI BibTeX RDF |
exclusion relations, nonpreemptive schedule, automated pre-run-time scheduling, scheduling, real-time systems, multiprocessing systems, deadlines, multiprocessor scheduling, hard-real-time systems, release times, precedence |
32 | T. A. Guldemond, Johann L. Hurink, Jacob Jan Paulus, J. M. J. Schutten |
Time-constrained project scheduling. |
J. Sched. |
2008 |
DBLP DOI BibTeX RDF |
Strict deadlines, Project scheduling |
32 | Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mossé, Rami G. Melhem |
Scheduling optional computations in fault-tolerant real-time systems. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
optional computation scheduling, fault-tolerant real-time systems, failure hypothesis, combinatorial space, synthetic task sets, simulation, scheduling, real-time systems, computational complexity, heuristic algorithms, schedulability analysis, software fault tolerance, deadlines, run-time |
32 | Biswaroop Mukherjee, Tim Brecht |
Time-Lined TCP for the TCP-Friendly Delivery of Streaming Media. |
ICNP |
2000 |
DBLP DOI BibTeX RDF |
time-lined TCP, TCP-friendly streaming data delivery, time-sensitive data, loss-tolerant applications, streaming media players, unicast delivery, transport level, TLTCP, streaming media applications, time-lined data delivery, simulations, Internet, Internet, protocol, congestion control, transport protocols, encoding, encoding, application program interfaces, API, deadlines, telecommunication traffic, data communication, UDP, telecommunication congestion control, bandwidth sharing, user level, MPEG-1 |
32 | Marco Caccamo, Giorgio C. Buttazzo |
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
periodic task skips, aperiodic responsiveness, video reception, aperiodic requests, offline analysis, multimedia systems, timing constraints, software performance evaluation, real-time applications, deadlines, scheduling theory, earliest deadline first scheduling, average response time, telecommunication systems |
32 | Chang-Gun Lee, Young-Kuk Kim, Sang Hyuk Son, Sang Lyul Min, Chong-Sang Kim |
Efficiently supporting hard/soft deadline transactions in real-time database systems. |
RTCSA |
1996 |
DBLP DOI BibTeX RDF |
hard/soft deadline transactions, temporally valid data objects, soft-deadlines, real-time systems, timing constraints, temporal consistency, real-time database systems, database operations, implementation complexity |
32 | Ching-Chih Han, Kang G. Shin |
Message transmission with timing constraints in ring networks . |
RTSS |
1996 |
DBLP DOI BibTeX RDF |
message transmission problem, unidirectional slotted ring networks, evacuation mode, continuation mode, system initialization, message scheduling policies, message deadlines, maximum delay, least-slack-time-first scheduling policy, optimal scheduling policy, farthest-destination-first policy, message passing, performance measures, timing constraints, average delay, operation modes |
32 | Dong-Won Park, Swaminathan Natarajan, Arkady Kanevsky, Myung Jun Kim |
A generalized utilization bound test for fixed-priority real-time scheduling. |
RTCSA |
1995 |
DBLP DOI BibTeX RDF |
generalized utilization bound test, fixed-priority real-time scheduling, utilization bound test, rate-monotonic priority assignment, exact schedulability criterion, task deadlines, linear programming, linear programming, processor scheduling, multiprogramming |
32 | Amitava Raha, Nicholas Malcolm, Wei Zhao 0001 |
Hard real-time communications with weighted round robin service in ATM local area networks. |
ICECCS |
1995 |
DBLP DOI BibTeX RDF |
hard real-time communications, weighted round robin service, output link scheduling, message deadlines, weighted round robin scheduling policy, weighted round robin scheduling, hard real-time connections, admission probability, heuristic scheme, scheduling, asynchronous transfer mode, ATM, local area networks, local area networks, system performance |
32 | Ben A. Blake, Karsten Schwan |
Experimental Evaluation of a Real-Time Scheduler for a Multiprocessor System. |
IEEE Trans. Software Eng. |
1991 |
DBLP DOI BibTeX RDF |
processor deadlines, process execution times, earliest possible start times, scheduling, real-time systems, real-time scheduler, multiprocessor system, multiprocessor scheduler, multiprogramming, assignment, robotics applications |
32 | Petri Ihantola, Ilenia Fronza, Tommi Mikkonen, Miska Noponen, Arto Hellas |
Deadlines and MOOCs: How Do Students Behave in MOOCs with and without Deadlines. |
FIE |
2020 |
DBLP DOI BibTeX RDF |
|
32 | Louis Fein |
The place of self-repairing facilities in computers with deadlines to meet. |
IRE-ACM-AIEE Computer Conference (Eastern) |
1957 |
DBLP DOI BibTeX RDF |
|
32 | Alan L. Leiner, William A. Notz, Jay L. Smith, Arnold Weinberger |
Organizing a network of computers to meet deadlines. |
IRE-ACM-AIEE Computer Conference (Eastern) |
1957 |
DBLP DOI BibTeX RDF |
|
30 | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra |
Buffer management for colored packets with deadlines. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
dram scheduling, online algorithms, buffer management, packets scheduling, earliest deadline first |
30 | Cong Liu 0007, Sanjeev Baskiyar |
Scheduling Mixed Tasks with Deadlines in Grids Using Bin Packing. |
ICPADS |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 |
The Parameterized Approximability of TSP with Deadlines. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Guido Governatori, Joris Hulstijn, Régis Riveret, Antonino Rotolo |
Characterising Deadlines in Temporal Modal Defeasible Logic. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Frédéric Cuppens, Nora Cuppens-Boulahia, Thierry Sans |
Nomad: A Security Model with Non Atomic Actions and Deadlines. |
CSFW |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Tarek F. Abdelzaher, Gautam H. Thaker, Patrick J. Lardieri |
A Feasible Region for Meeting Aperiodic End-to-End Deadlines in Resource Pipelines. |
ICDCS |
2004 |
DBLP DOI BibTeX RDF |
total ship computing environment, Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
30 | Pao-Ann Hsiung, Cheng-Yi Lin |
Synthesis of real-time embedded software with local and global deadlines. |
CODES+ISSS |
2003 |
DBLP DOI BibTeX RDF |
quasi-dynamic scheduling, real-time petri nets, code generation, software synthesis, real-time embedded software |
30 | Tao Zheng, C. Murray Woodside |
Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines. |
Computer Performance Evaluation / TOOLS |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Hui Wu 0001, Joxan Jaffar |
Two processor scheduling with real release times and deadlines. |
SPAA |
2002 |
DBLP DOI BibTeX RDF |
release time and deadline, successor-tree-consistency, task scheduling, feasible schedule |
30 | Sven Koenig |
Planning-Task Transformations for Soft Deadlines. |
ATAL |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Marco Di Natale, Antonio Meschi |
Guaranteeing end-to-end deadlines in distributed client-server applications. |
ECRTS |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Frank Dignum, Ruurd Kuiper 0001 |
Combining Dynamic Deontic Logic and Temporal Logic for the Specification of Deadlines. |
HICSS (5) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Oh-Heum Kwon, Kyung-Yong Chwa |
Scheduling Parallel Tasks with Individual Deadlines. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
30 | Amitava Raha, Sanjay Kamat, Wei Zhao 0001 |
Using traffic regulation to meet end-to-end deadlines in ATM LANs. |
ICNP |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Abhik Sarkar, Frank Mueller 0001, Harini Ramaprasad, Sibin Mohan |
Push-assisted migration of real-time tasks in multi-core processors. |
LCTES |
2009 |
DBLP DOI BibTeX RDF |
task migration., real-time systems, timing analysis, multi-core architectures |
29 | Liliana Cucu, Nicolas Pernet, Yves Sorel |
Periodic real-time scheduling: from deadline-based model to latency-based model. |
Ann. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
Scheduling, Real-time, Latency, Deadline, Periodicity, Non-preemptive |
29 | Theodore P. Baker, Michele Cirinei, Marko Bertogna |
EDZL scheduling analysis. |
Real Time Syst. |
2008 |
DBLP DOI BibTeX RDF |
EDZL, Earliest deadline zero laxity, Symmetric multiprocessing, Scheduling, Schedulability, Real time, Multiprocessor, EDF, Earliest deadline first |
29 | Patricia Balbastre, Ismael Ripoll, Alfons Crespo |
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
Scheduling, Real-time systems and embedded systems |
29 | Thidapat Chantem, Xiaofeng Wang 0007, Michael D. Lemmon, Xiaobo Sharon Hu |
Period and Deadline Selection for Schedulability in Real-Time Systems. |
ECRTS |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Michele Cirinei, Theodore P. Baker |
EDZL Scheduling Analysis. |
ECRTS |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Cong Liu 0007, Sanjeev Baskiyar, Shuang Li |
A General Distributed Scalable Peer to Peer Scheduler for Mixed Tasks in Grids. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Mehdi Kargahi, Ali Movaghar 0001 |
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy. |
J. Supercomput. |
2006 |
DBLP DOI BibTeX RDF |
soft real-time (SRT) systems, performance modeling, multiprocessor systems, earliest-deadline-first (EDF), analytical methods, approximation methods |
29 | Patricia Balbastre, Ismael Ripoll, Alfons Crespo |
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems. |
ECRTS |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Rachel M. Fewster, Emilia Mendes |
Portfolio Management Method for Deadline Planning. |
IEEE METRICS |
2003 |
DBLP DOI BibTeX RDF |
project management, risk management, effort estimation, risk analysis, regression model |
29 | Ian Broster, Guillem Bernat, Alan Burns 0001 |
Weakly Hard Real-time Constraints on Controller Area Network. |
ECRTS |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Walid G. Aref, Ibrahim Kamel, Shahram Ghandeharizadeh |
Disk Scheduling in Video Editing Systems. |
IEEE Trans. Knowl. Data Eng. |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Guillem Bernat, Ricardo Cayssials |
Guaranteed On-Line Weakly-Hard Real-Time Systems. |
RTSS |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Ray-I Chang, Wei-Kuan Shih, Ruei-Chuan Chang |
Multimedia Real-Time Disk Scheduling by Hybrid Local/Global Seek-Optimizing Approaches. |
ICPADS |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Jin Hyun Son, Jung Hoon Kim, Myoung-Ho Kim |
Hard/Soft Deadline Assignment for High Workflow Throughput. |
DANTE |
1999 |
DBLP DOI BibTeX RDF |
Deadline Assignment, Workflow, Throughput |
24 | Theodore P. Baker, Sanjoy K. Baruah |
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems. |
Real Time Syst. |
2009 |
DBLP DOI BibTeX RDF |
Sporadic task systems, Schedulability analysis, Multiprocessor scheduling, EDF, Earliest deadline first, Global scheduling, Arbitrary deadlines |
24 | Luís Fernando Orleans, Geraldo Zimbrão |
MIDAS: A Middleware for Information Systems with QoS Concerns. |
ICEIS |
2009 |
DBLP DOI BibTeX RDF |
QoS for Databases, Transactions with deadlines, Database Performance, Midas |
24 | Sivakumar Viswanathan, Bharadwaj Veeravalli, Thomas G. Robertazzi |
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems. |
IEEE Trans. Parallel Distributed Syst. |
2007 |
DBLP DOI BibTeX RDF |
Grid computing, Cluster computing, deadlines, Divisible loads, processing time, buffer constraints |
24 | John Aycock, Jim Uhl |
Choice in the classroom. |
ACM SIGCSE Bull. |
2005 |
DBLP DOI BibTeX RDF |
contract grading, due dates, deadlines, assignments |
24 | Yin-Fu Huang, Jiing-Maw Huang |
Disk Scheduling onMultimedia Storage Servers. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
seek overheads, deadlines, disk scheduling, Multimedia storage servers |
24 | Mohammad Islam, Pavan Balaji, P. Sadayappan, Dhabaleswar K. Panda 0001 |
QoPS: A QoS Based Scheme for Parallel Job Scheduling. |
JSSPP |
2003 |
DBLP DOI BibTeX RDF |
QoS, Job Scheduling, Deadlines, Parallel Job Scheduling |
24 | Vishnu Swaminathan, Charles B. Schweizer, Krishnendu Chakrabarty, Amil A. Patel |
Experiences in Implementing an Energy-Driven Task Scheduler in RT-Linux. |
IEEE Real Time Technology and Applications Symposium |
2002 |
DBLP DOI BibTeX RDF |
low energy earliest-deadline-first (LEDF) scheduling, RT-Linux, variable-speed task scheduling, dynamic voltage scaling, Deadlines |
24 | Andrés Terrasa, Ana García-Fornes, Vicente J. Botti |
Including user-defined timing exception support in FRTL. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
user-defined timing exception support, FRTL, flexible hard real-time systems, task deadlines, Flexible Real-Time Linux, CPU consumption, real-time systems, Unix, exception handling, worst-case execution time, operating systems (computers), run-time system, feasibility test |
24 | Victor C. S. Lee, Kwok-Wa Lam, Sang Hyuk Son |
Real-time transaction processing with partial validation at mobile clients. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
real-time transaction processing, partial validation, conflicting mobile transactions, data conflict detection, two-stage validation mechanism, processing resources, communication resources, transaction execution schedules, unnecessary transaction aborts, avoidable delay removal, asymmetric communication, schedule, real-time systems, mobile computing, data integrity, delays, concurrency control, wireless communication, transaction processing, client-server systems, deadlines, access protocols, mobile computing environments, mobile clients, concurrency control protocols |
24 | Joël Goossens, Sanjoy K. Baruah |
Multiprocessor algorithms for uniprocessor feasibility analysis. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
multiprocessor algorithms, uniprocessor feasibility analysis, uniprocessor real-time systems, asynchronous periodic tasks, preemptive earliest deadline first scheduling, scheduling, real-time systems, parallel algorithms, parallel algorithm, multiprocessing systems, parallel machines, parallel machines, task models, scheduling algorithms, deadlines, hard real-time system |
24 | Alexander Münnich |
PRED-DF - a data flow based semantic concurrency control protocol for real-time main-memory database systems. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
PRED-DF semantic concurrency control protocol, predeclaration, real-time main-memory database systems, locking-based protocol, serializable schedule generation, blocking time minimization, predictable behaviour, real-time requirements verification, scheduling, real-time systems, predictability, concurrency control, database management systems, task scheduling, data flow analysis, data flow analysis, deadlines, access protocols, hard real-time systems, safety-critical software, safety-critical applications, verification methods |
24 | Radu Dobrin, Yusuf Özdemir, Gerhard Fohler |
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
task attribute assignment, fixed priority scheduled tasks, offline schedules, time triggered approaches, end-to-end deadlines, processor scheduling, jitter, jitter |
24 | Fuminori Nakanishi, Shinnya Hiraike, Shinji Inoue, Yoshiaki Kakuda, Kenji Toda |
A Flexible Scheduling for Automobile Control Using Imprecise Computation and Its Fundamental Evaluation. |
ICECCS |
2000 |
DBLP DOI BibTeX RDF |
automobile control, task deadlines, expressway, automobile collision, scheduling, real time systems, intelligent transportation system, imprecise computation, flexible scheduling |
24 | Steven P. Ketchpel, Hector Garcia-Molina |
A Sound and Complete Algorithm for Distributed Commerce Transactions. |
Distributed Comput. |
1999 |
DBLP DOI BibTeX RDF |
Distributed commerce transactions, Trusted intermediaries, Trust, Deadlines, Commit protocols |
24 | Giorgio C. Buttazzo, Marco Caccamo |
Minimizing Aperiodic Response Times in a Firm Real-Time Environment. |
IEEE Trans. Software Eng. |
1999 |
DBLP DOI BibTeX RDF |
aperiodic service, firm deadlines, quality of service, Real-time scheduling, skip |
24 | Carl K. Chang, Yi-Te Tseng, Ugo A. Buy |
Compiling process algebraic specifications into timed automata. |
COMPSAC |
1997 |
DBLP DOI BibTeX RDF |
Language of Timed Processes, process algebraic specification compilation, process-algebra-based specification language, process descriptions, periodic constraints, sporadic constraints, periodic behavior modelling, finite representation, delays, computations, timed automata, translation, algebraic specification, real-time applications, deadlines, execution time, automatic verification, timeouts, timing requirement, LTP, timed transition systems |
24 | John P. Lehoczky |
Real-time queueing network theory. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
real-time queueing network theory, Jackson queueing networks, end-to-end deadlines, instantaneous multidimensional profiles, multivariate Brownian motion, deterministic profile, queue control policies, queueing theory, traffic intensity |
24 | Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritham |
More optimism about real-time distributed commit processing. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
real-time distributed commit processing, OPT, firm-deadline real-time database systems, data inaccessibility, missed transaction deadlines, sequential transactions, parallel distributed transactions, Shadow-OPT, healthy lenders heuristic, alternative priority, inheritance-based approach, performance, distributed databases, transaction processing, real-time performance, system configurations, commit protocol, priority inversion |
24 | Sonia Mettali Gammar, Farouk Kamoun |
A comparison of scheduling algorithms for real time distributed transactional systems. |
FTDCS |
1997 |
DBLP DOI BibTeX RDF |
real time distributed transactional systems, distributed database update, globally consistent orderings, nonpreemptive earliest deadline first, simulation, distributed databases, concurrency control, consensus, scheduling algorithms, deadlines, serializability, client server, tokens, timeliness, system parameters, database consistency |
24 | Ben Kao, Hector Garcia-Molina |
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
dual servers, soft deadlines, scheduling, distributed systems, Real-time systems |
24 | Jyhjong Lin, David Chenho Kung, Pei Hsia |
Top-down development of real-time software specification. |
HASE |
1996 |
DBLP DOI BibTeX RDF |
fault tolerance specification, system dependability, system repair, input output automata, fire control system, combat vehicle, software fault tolerance, deadlines, temporal properties, I/O automata, mission critical systems |
24 | Tolety Siva Perraju, Satyendra Pal Rana, Susanta P. Sarkar |
Specifying fault tolerance in mission critical systems. |
HASE |
1996 |
DBLP DOI BibTeX RDF |
fault tolerance specification, system dependability, system repair, input output automata, fire control system, combat vehicle, software fault tolerance, deadlines, temporal properties, I/O automata, mission critical systems |
24 | Hsing Mei |
Scheduling dependent real-time multimedia tasks on distributed systems. |
COMPSAC |
1995 |
DBLP DOI BibTeX RDF |
real-time multimedia task scheduling, periodic dependent real-time multimedia tasks, Multimedia Task Graph model, system reward value, scheduling, Quality of Services, distributed systems, real-time systems, resource allocation, distributed processing, software quality, synchronisation, processor scheduling, deadlines, multimedia computing, execution time, average response time, synchronization methods |
24 | Ching-Chih Han, Kang G. Shin |
Real-time communication in FieldBus multiaccess networks. |
IEEE Real Time Technology and Applications Symposium |
1995 |
DBLP DOI BibTeX RDF |
field buses, FieldBus multiaccess networks, automated factories, absolute deadline guarantees, multiaccess local area networks, SP-50 FieldBus, industrial standard protocol, manufacturing applications, token-passing networks, centralized scheduling multiaccess network, centralized token scheduling, pinwheel, distance-constrained scheduling, centralized-scheduling multiaccess networks, message deadlines, scheduling, real-time systems, protocols, local area networks, timing constraints, real-time communication, random access, embedded real-time systems, computer integrated manufacturing, token networks, multi-access systems, CSMA/CD, industrial process controls, multiaccess networks |
24 | Ernst W. Mayr |
Scheduling interval orders in parallel. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems |
Displaying result #1 - #100 of 1841 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|