Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2012
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG), Volume 9, Issue 1Article No.: 6, Pages 1–19https://doi.org/10.1145/2390176.2390182We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no pseudopolynomial-time algorithm can test the feasibility of a task system within a constant speedup bound, unless P = NP. ...
- research-articleOctober 2012
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
ACM Transactions on Algorithms (TALG), Volume 8, Issue 4Article No.: 40, Pages 1–16https://doi.org/10.1145/2344422.2344430Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its due date. We present an FPTAS for the basic scheduling problem of minimizing ...
- research-articleDecember 2010
The compressed permuterm index
ACM Transactions on Algorithms (TALG), Volume 7, Issue 1Article No.: 10, Pages 1–21https://doi.org/10.1145/1868237.1868248The Permuterm index [Garfield 1976] is a time-efficient and elegant solution to the string dictionary problem in which pattern queries may possibly include one wild-card symbol (called Tolerant Retrieval problem). Unfortunately the Permuterm index is ...
- research-articleMarch 2008
The collective memory of amnesic processes
ACM Transactions on Algorithms (TALG), Volume 4, Issue 1Article No.: 12, Pages 1–31https://doi.org/10.1145/1328911.1328923This article considers the problem of robustly emulating a shared atomic memory over a distributed message-passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and ...
