Search results for "Preemptions"

Found 115 publication records. Showing 115 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Elena Fersman, Paul Pettersson, Wang Yi 0001	Timed Automata with Asynchronous Processes: Schedulability and Decidability.	TACAS	2002	DBLP DOI BibTeX RDF
15	Mahmoud Naghibzadeh, K. H. (Kane) Kim	A Modified Version of Rate-Monotonic Scheduling Algorithm and its Efficiency Assessment.	WORDS	2002	DBLP DOI BibTeX RDF	Delayed rate-monotonic algorithm, real-time systems, periodic tasks, rate-monotonic algorithm
15	Eric Angel, Evripidis Bampis, Alexander V. Kononov	A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.	ESA	2001	DBLP DOI BibTeX RDF
15	Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé	A case for use-level dynamic page migration.	ICS	2000	DBLP DOI BibTeX RDF
15	Henrik Thane, Hans Hansson	Handling Interrupts in Testing of Distributed Real-Time Systems.	RTCSA	1999	DBLP DOI BibTeX RDF	scheduling, Testing, interrupts, testability, determinism, distributed real-time systems, reproducibility, response-time analysis, sporadic tasks, probe-effect
15	Henrik Thane, Hans Hansson	Towards Systematic Testing of Distributed Real-Time Systems.	RTSS	1999	DBLP DOI BibTeX RDF	scheduling, Testing, testability, determinism, distributed real-time systems, reproducibility, response-time analysis, probe-effect
15	Chandra Chekuri, Michael A. Bender	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.	IPCO	1998	DBLP DOI BibTeX RDF
15	James H. Anderson, Mark Moir	Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations.	Distributed Comput.	1997	DBLP DOI BibTeX RDF	k -Assignment, k -Exclusion, Shared subjects, Shared-memory multiprocessors, Resiliency, Wait-free, Local spinning
15	Yanbing Li, Wayne H. Wolf	A Task-Level Hierarchical Memory Model for System Synthesis of Multiprocessors.	DAC	1997	DBLP DOI BibTeX RDF
15	R. Gopalakrishnan, Guru M. Parulkar	Bringing Real-Time Scheduling Theory and Practice Closer for Multimedia Computing.	SIGMETRICS	1996	DBLP DOI BibTeX RDF
15	José V. Busquets-Mataix, Juan José Serrano, Rafael Ors, Pedro J. Gil, Andy J. Wellings	Using harmonic task-sets to increase the schedulable utilization of cache-based preemptive real-time systems.	RTCSA	1996	DBLP DOI BibTeX RDF	harmonic task-sets, schedulable utilization, preemptive real-time systems, better performance, cache-related preemption cost, Response Time schedulability Analysis, real-time systems, cache memories, worst-case execution time, schedulability analysis
15	Raoul Bhoedjang, Koen Langendoen	Friendly and Efficient Message Handling.	HICSS (1)	1996	DBLP DOI BibTeX RDF
15	Yahui Zhu, Mohan Ahuja	On Job Scheduling on a Hypercube.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	LDF algorithm, job preemption, minimum finish time schedule, list scheduling algorithm, absolute bound, scheduling, computational complexity, distributed algorithms, lower bound, NP-complete, hypercube, hypercube networks, scheduling algorithms, job scheduling
15	Ramesh Govindan, David P. Anderson	Scheduling and IPC Mechanisms for Continuous Media.	SOSP	1991	DBLP DOI BibTeX RDF
15	Teofilo F. Gonzalez, Donald B. Johnson 0001	A New Algorithm for Preemptive Scheduling of Trees.	J. ACM	1980	DBLP DOI BibTeX RDF