{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H7MMRGLEMUAFSDVGSGIK6CET35","short_pith_number":"pith:H7MMRGLE","schema_version":"1.0","canonical_sha256":"3fd8c899646500590ea69190af0893df6a2ceaf67c4ef5275c1c2564e01dc60b","source":{"kind":"arxiv","id":"1712.10201","version":1},"attestation_state":"computed","paper":{"title":"Metascheduling of HPC Jobs in Day-Ahead Electricity Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Prakash Murali, Sathish Vadhiyar","submitted_at":"2017-12-29T12:25:28Z","abstract_excerpt":"High performance grid computing is a key enabler of large scale collaborative computational science. With the promise of exascale computing, high performance grid systems are expected to incur electricity bills that grow super-linearly over time. In order to achieve cost effectiveness in these systems, it is essential for the scheduling algorithms to exploit electricity price variations, both in space and time, that are prevalent in the dynamic electricity price markets. In this paper, we present a metascheduling algorithm to optimize the placement of jobs in a compute grid which consumes elec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.10201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T12:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"a0e02975e898789beb5144e5af728ad3e9cc2d1c5645da4a10df1b27c9394ade","abstract_canon_sha256":"b1eac7735fa5814fa0d0c558a2c6f761cd86be32b1d92cb4bb2ad691461579dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.719455Z","signature_b64":"vZ1HBfkN26sxxhLNbSPAyGNzYqlwRLEJMZuyHjdvGiNmeW4Z/PRR04ycnVAEtnZLDhsGQZgT9S9Rxnlbci9JBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd8c899646500590ea69190af0893df6a2ceaf67c4ef5275c1c2564e01dc60b","last_reissued_at":"2026-05-18T00:27:03.719016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.719016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metascheduling of HPC Jobs in Day-Ahead Electricity Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Prakash Murali, Sathish Vadhiyar","submitted_at":"2017-12-29T12:25:28Z","abstract_excerpt":"High performance grid computing is a key enabler of large scale collaborative computational science. With the promise of exascale computing, high performance grid systems are expected to incur electricity bills that grow super-linearly over time. In order to achieve cost effectiveness in these systems, it is essential for the scheduling algorithms to exploit electricity price variations, both in space and time, that are prevalent in the dynamic electricity price markets. In this paper, we present a metascheduling algorithm to optimize the placement of jobs in a compute grid which consumes elec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10201","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.10201","created_at":"2026-05-18T00:27:03.719085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.10201v1","created_at":"2026-05-18T00:27:03.719085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10201","created_at":"2026-05-18T00:27:03.719085+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7MMRGLEMUAF","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7MMRGLEMUAFSDVG","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7MMRGLE","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35","json":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35.json","graph_json":"https://pith.science/api/pith-number/H7MMRGLEMUAFSDVGSGIK6CET35/graph.json","events_json":"https://pith.science/api/pith-number/H7MMRGLEMUAFSDVGSGIK6CET35/events.json","paper":"https://pith.science/paper/H7MMRGLE"},"agent_actions":{"view_html":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35","download_json":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35.json","view_paper":"https://pith.science/paper/H7MMRGLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.10201&json=true","fetch_graph":"https://pith.science/api/pith-number/H7MMRGLEMUAFSDVGSGIK6CET35/graph.json","fetch_events":"https://pith.science/api/pith-number/H7MMRGLEMUAFSDVGSGIK6CET35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35/action/storage_attestation","attest_author":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35/action/author_attestation","sign_citation":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35/action/citation_signature","submit_replication":"https://pith.science/pith/H7MMRGLEMUAFSDVGSGIK6CET35/action/replication_record"}},"created_at":"2026-05-18T00:27:03.719085+00:00","updated_at":"2026-05-18T00:27:03.719085+00:00"}