{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LDAQ6UWSF23H6HYDXZKMFQ7KD5","short_pith_number":"pith:LDAQ6UWS","schema_version":"1.0","canonical_sha256":"58c10f52d22eb67f1f03be54c2c3ea1f633cb34e2dac6ff64f36c2a51d93046c","source":{"kind":"arxiv","id":"1803.03288","version":2},"attestation_state":"computed","paper":{"title":"TicTac: Accelerating Distributed Deep Learning with Communication Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.DC","authors_text":"Roy H. Campbell, Sangeetha Abdu Jyothi, Sayed Hadi Hashemi","submitted_at":"2018-03-08T20:03:51Z","abstract_excerpt":"State-of-the-art deep learning systems rely on iterative distributed training to tackle the increasing complexity of models and input data. The iteration time in these communication-heavy systems depends on the computation time, communication time and the extent of overlap of computation and communication.\n  In this work, we identify a shortcoming in systems with graph representation for computation, such as TensorFlow and PyTorch, that result in high variance in iteration time --- random order of received parameters across workers. We develop a system, TicTac, to improve the iteration time by"},"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":"1803.03288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-08T20:03:51Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"a1314a8cf5cc6199fc6096b9daa2be127c4351b5ff851423b755f00780cff1e3","abstract_canon_sha256":"7685537673dbc01341d53deb8dc0fc20b9738b1a276e5a0cc61b5c2772e8bcac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.871825Z","signature_b64":"G1Fmml7u6rWx2d1Ygxqa/g94OR174q30bLqFpkwrhRojrex0ABny5EZuDpOBbbLykFYiCd8//Jo97pbC+OyaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c10f52d22eb67f1f03be54c2c3ea1f633cb34e2dac6ff64f36c2a51d93046c","last_reissued_at":"2026-05-18T00:04:07.871117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.871117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TicTac: Accelerating Distributed Deep Learning with Communication Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.DC","authors_text":"Roy H. Campbell, Sangeetha Abdu Jyothi, Sayed Hadi Hashemi","submitted_at":"2018-03-08T20:03:51Z","abstract_excerpt":"State-of-the-art deep learning systems rely on iterative distributed training to tackle the increasing complexity of models and input data. The iteration time in these communication-heavy systems depends on the computation time, communication time and the extent of overlap of computation and communication.\n  In this work, we identify a shortcoming in systems with graph representation for computation, such as TensorFlow and PyTorch, that result in high variance in iteration time --- random order of received parameters across workers. We develop a system, TicTac, to improve the iteration time by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03288","kind":"arxiv","version":2},"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":"1803.03288","created_at":"2026-05-18T00:04:07.871232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03288v2","created_at":"2026-05-18T00:04:07.871232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03288","created_at":"2026-05-18T00:04:07.871232+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDAQ6UWSF23H","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDAQ6UWSF23H6HYD","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDAQ6UWS","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2006.15704","citing_title":"PyTorch Distributed: Experiences on Accelerating Data Parallel Training","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06544","citing_title":"CCL-Bench 1.0: A Trace-Based Benchmark for LLM Infrastructure","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5","json":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5.json","graph_json":"https://pith.science/api/pith-number/LDAQ6UWSF23H6HYDXZKMFQ7KD5/graph.json","events_json":"https://pith.science/api/pith-number/LDAQ6UWSF23H6HYDXZKMFQ7KD5/events.json","paper":"https://pith.science/paper/LDAQ6UWS"},"agent_actions":{"view_html":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5","download_json":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5.json","view_paper":"https://pith.science/paper/LDAQ6UWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03288&json=true","fetch_graph":"https://pith.science/api/pith-number/LDAQ6UWSF23H6HYDXZKMFQ7KD5/graph.json","fetch_events":"https://pith.science/api/pith-number/LDAQ6UWSF23H6HYDXZKMFQ7KD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5/action/storage_attestation","attest_author":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5/action/author_attestation","sign_citation":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5/action/citation_signature","submit_replication":"https://pith.science/pith/LDAQ6UWSF23H6HYDXZKMFQ7KD5/action/replication_record"}},"created_at":"2026-05-18T00:04:07.871232+00:00","updated_at":"2026-05-18T00:04:07.871232+00:00"}