{'fraction_non_alphanumeric': 0.022068965517241378, 'fraction_numerical': 0.001379310344827586, 'mean_word_length': 5.424778761061947, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Competitive on-line scheduling of imprecise computations

The on-line scheduling of systems of imprecise computation tasks is investigated. The system objective is to maximise the value obtained. A formal model is defined. Under certain reasonable assumptions formalized here as the weak feasible mandatory constraint a 2-competitive on-line scheduling algorithm is presented for the commonly studied uniform-density task systems. It is proven, however, that an on-line algorithm may in general perform arbitrarily poorly as compared to a clairvoyant scheduler. A case study is included illustrating how competitive on-line schedulers may be constructed for individual applications, based on their own unique characteristics.